Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540380443, 9783540380450

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

A Tight Lower Bound for the Steiner Point Removal Problem on Trees

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - Lecture Notes in Computer Science ◽

10.1007/11830924_9 ◽

2006 ◽

pp. 70-81 ◽

Cited By ~ 1

Author(s):

T. -H. Hubert Chan ◽

Donglin Xia ◽

Goran Konjevod ◽

Andrea Richa

Keyword(s):

Lower Bound ◽

Steiner Point

Download Full-text

Dobrushin Conditions and Systematic Scan

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - Lecture Notes in Computer Science ◽

10.1007/11830924_31 ◽

2006 ◽

pp. 327-338 ◽

Cited By ~ 4

Author(s):

Martin Dyer ◽

Leslie Ann Goldberg ◽

Mark Jerrum

Download Full-text

Better Approximations for the Minimum Common Integer Partition Problem

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - Lecture Notes in Computer Science ◽

10.1007/11830924_24 ◽

2006 ◽

pp. 248-259 ◽

Cited By ~ 6

Author(s):

David P. Woodruff

Keyword(s):

Partition Problem ◽

Integer Partition

Download Full-text

Analysis of Algorithms on the Cores of Random Graphs

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - Lecture Notes in Computer Science ◽

10.1007/11830924_2 ◽

2006 ◽

pp. 2-2

Author(s):

Nick Wormald

Keyword(s):

Random Graphs ◽

Analysis Of Algorithms

Download Full-text

Complete Convergence of Message Passing Algorithms for Some Satisfiability Problems

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - Lecture Notes in Computer Science ◽

10.1007/11830924_32 ◽

2006 ◽

pp. 339-350 ◽

Cited By ~ 12

Author(s):

Uriel Feige ◽

Elchanan Mossel ◽

Dan Vilenchik

Keyword(s):

Message Passing ◽

Complete Convergence ◽

Satisfiability Problems ◽

Message Passing Algorithms

Download Full-text

Approximation Algorithms for Graph Homomorphism Problems

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - Lecture Notes in Computer Science ◽

10.1007/11830924_18 ◽

2006 ◽

pp. 176-187 ◽

Cited By ~ 12

Author(s):

Michael Langberg ◽

Yuval Rabani ◽

Chaitanya Swamy

Keyword(s):

Approximation Algorithms ◽

Graph Homomorphism

Download Full-text

Single-Source Stochastic Routing

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - Lecture Notes in Computer Science ◽

10.1007/11830924_10 ◽

2006 ◽

pp. 82-94 ◽

Cited By ~ 3

Author(s):

Shuchi Chawla ◽

Tim Roughgarden

Keyword(s):

Single Source ◽

Stochastic Routing

Download Full-text

Combinatorial Algorithms for Data Migration to Minimize Average Completion Time

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - Lecture Notes in Computer Science ◽

10.1007/11830924_14 ◽

2006 ◽

pp. 128-139 ◽

Cited By ~ 3

Author(s):

Rajiv Gandhi ◽

Julián Mestre

Keyword(s):

Completion Time ◽

Data Migration ◽

Combinatorial Algorithms ◽

Average Completion Time

Download Full-text

A Fast Random Sampling Algorithm for Sparsifying Matrices

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - Lecture Notes in Computer Science ◽

10.1007/11830924_26 ◽

2006 ◽

pp. 272-279 ◽

Cited By ~ 22

Author(s):

Sanjeev Arora ◽

Elad Hazan ◽

Satyen Kale

Keyword(s):

Random Sampling ◽

Sampling Algorithm

Download Full-text

Local Decoding and Testing for Homomorphisms

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - Lecture Notes in Computer Science ◽

10.1007/11830924_35 ◽

2006 ◽

pp. 375-385

Author(s):

Elena Grigorescu ◽

Swastik Kopparty ◽

Madhu Sudan

Download Full-text

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

A Tight Lower Bound for the Steiner Point Removal Problem on Trees

Dobrushin Conditions and Systematic Scan

Better Approximations for the Minimum Common Integer Partition Problem

Analysis of Algorithms on the Cores of Random Graphs

Complete Convergence of Message Passing Algorithms for Some Satisfiability Problems

Approximation Algorithms for Graph Homomorphism Problems

Single-Source Stochastic Routing

Combinatorial Algorithms for Data Migration to Minimize Average Completion Time

A Fast Random Sampling Algorithm for Sparsifying Matrices

Local Decoding and Testing for Homomorphisms

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - Lecture Notes in Computer Science
Latest Publications