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

9783642036842, 9783642036859

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Minimizing Average Shortest Path Distances via Shortcut Edge Addition

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

10.1007/978-3-642-03685-9_21 ◽

2009 ◽

pp. 272-285 ◽

Cited By ~ 30

Author(s):

Adam Meyerson ◽

Brian Tagiku

Keyword(s):

Shortest Path ◽

Edge Addition

Download Full-text

Strong Parallel Repetition Theorem for Free Projection Games

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

10.1007/978-3-642-03685-9_27 ◽

2009 ◽

pp. 352-365 ◽

Cited By ~ 11

Author(s):

Boaz Barak ◽

Anup Rao ◽

Ran Raz ◽

Ricky Rosen ◽

Ronen Shaltiel

Keyword(s):

Parallel Repetition ◽

Projection Games

Download Full-text

Truthful Mechanisms via Greedy Iterative Packing

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

10.1007/978-3-642-03685-9_5 ◽

2009 ◽

pp. 56-69 ◽

Cited By ~ 10

Author(s):

Chandra Chekuri ◽

Iftah Gamzu

Download Full-text

Average-Case Analyses of Vickrey Costs

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

10.1007/978-3-642-03685-9_33 ◽

2009 ◽

pp. 434-447 ◽

Cited By ~ 1

Author(s):

Prasad Chebolu ◽

Alan Frieze ◽

Páll Melsted ◽

Gregory B. Sorkin

Keyword(s):

Average Case

Download Full-text

Testing Computability by Width Two OBDDs

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

10.1007/978-3-642-03685-9_51 ◽

2009 ◽

pp. 686-699 ◽

Cited By ~ 6

Author(s):

Dana Ron ◽

Gilad Tsur

Download Full-text

Robust Algorithms for on Minor-Free Graphs Based on the Sherali-Adams Hierarchy

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

10.1007/978-3-642-03685-9_20 ◽

2009 ◽

pp. 258-271 ◽

Cited By ~ 9

Author(s):

Avner Magen ◽

Mohammad Moharrami

Keyword(s):

Robust Algorithms ◽

Minor Free Graphs

Download Full-text

Approximating Node-Connectivity Augmentation Problems

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

10.1007/978-3-642-03685-9_22 ◽

2009 ◽

pp. 286-297 ◽

Cited By ~ 6

Author(s):

Zeev Nutov

Keyword(s):

Connectivity Augmentation ◽

Node Connectivity

Download Full-text

Erratum: Resource Minimization Job Scheduling

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

10.1007/978-3-642-03685-9_54 ◽

2009 ◽

pp. E1-E1

Author(s):

Julia Chuzhoy ◽

Paolo Codenotti

Keyword(s):

Job Scheduling ◽

Resource Minimization

Download Full-text

Algorithmic Aspects of Property Testing in the Dense Graphs Model

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

10.1007/978-3-642-03685-9_39 ◽

2009 ◽

pp. 520-533 ◽

Cited By ~ 1

Author(s):

Oded Goldreich ◽

Dana Ron

Keyword(s):

Property Testing ◽

Dense Graphs

Download Full-text

Extractors Using Hardness Amplification

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

10.1007/978-3-642-03685-9_35 ◽

2009 ◽

pp. 462-475 ◽

Cited By ~ 2

Author(s):

Anindya De ◽

Luca Trevisan

Keyword(s):

Hardness Amplification

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

Minimizing Average Shortest Path Distances via Shortcut Edge Addition

Strong Parallel Repetition Theorem for Free Projection Games

Truthful Mechanisms via Greedy Iterative Packing

Average-Case Analyses of Vickrey Costs

Testing Computability by Width Two OBDDs

Robust Algorithms for on Minor-Free Graphs Based on the Sherali-Adams Hierarchy

Approximating Node-Connectivity Augmentation Problems

Erratum: Resource Minimization Job Scheduling

Algorithmic Aspects of Property Testing in the Dense Graphs Model

Extractors Using Hardness Amplification

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