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

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540282396, 9783540318743

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

The Online Clique Avoidance Game on Random Graphs

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

10.1007/11538462_33 ◽

2005 ◽

pp. 390-401 ◽

Cited By ~ 3

Author(s):

Martin Marciniszyn ◽

Reto Spöhel ◽

Angelika Steger

Keyword(s):

Random Graphs

Download Full-text

The Complexity of Making Unique Choices: Approximating 1-in-k SAT

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

10.1007/11538462_9 ◽

2005 ◽

pp. 99-110 ◽

Cited By ~ 4

Author(s):

Venkatesan Guruswami ◽

Luca Trevisan

Download Full-text

An Improved Analysis of Mergers

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

10.1007/11538462_23 ◽

2005 ◽

pp. 270-281

Author(s):

Zeev Dvir ◽

Amir Shpilka

Download Full-text

Scheduling on Unrelated Machines Under Tree-Like Precedence Constraints

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

10.1007/11538462_13 ◽

2005 ◽

pp. 146-157 ◽

Cited By ~ 6

Author(s):

V. S. Anil Kumar ◽

Madhav V. Marathe ◽

Srinivasan Parthasarathy ◽

Aravind Srinivasan

Keyword(s):

Precedence Constraints ◽

Unrelated Machines

Download Full-text

The Tensor Product of Two Codes Is Not Necessarily Robustly Testable

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

10.1007/11538462_40 ◽

2005 ◽

pp. 472-481 ◽

Cited By ~ 18

Author(s):

Paul Valiant

Keyword(s):

Tensor Product

Download Full-text

A Continuous-Discontinuous Second-Order Transition in the Satisfiability of Random Horn-SAT Formulas

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

10.1007/11538462_35 ◽

2005 ◽

pp. 414-425

Author(s):

Cristopher Moore ◽

Gabriel Istrate ◽

Demetrios Demopoulos ◽

Moshe Y. Vardi

Keyword(s):

Second Order ◽

Order Transition ◽

Second Order Transition

Download Full-text

Mixing Points on a Circle

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

10.1007/11538462_36 ◽

2005 ◽

pp. 426-435 ◽

Cited By ~ 3

Author(s):

Dana Randall ◽

Peter Winkler

Download Full-text

Derandomized Constructions of k-Wise (Almost) Independent Permutations

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

10.1007/11538462_30 ◽

2005 ◽

pp. 354-365 ◽

Cited By ~ 19

Author(s):

Eyal Kaplan ◽

Moni Naor ◽

Omer Reingold

Download Full-text

Towards Optimal Integrality Gaps for Hypergraph Vertex Cover in the Lovász-Schrijver Hierarchy

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

10.1007/11538462_20 ◽

2005 ◽

pp. 233-244 ◽

Cited By ~ 2

Author(s):

Iannis Tourlakis

Keyword(s):

Vertex Cover ◽

Integrality Gaps

Download Full-text

Where’s the Winner? Max-Finding and Sorting with Metric Costs

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

10.1007/11538462_7 ◽

2005 ◽

pp. 74-85 ◽

Cited By ~ 3

Author(s):

Anupam Gupta ◽

Amit Kumar

Download Full-text

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

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

The Online Clique Avoidance Game on Random Graphs

The Complexity of Making Unique Choices: Approximating 1-in-k SAT

An Improved Analysis of Mergers

Scheduling on Unrelated Machines Under Tree-Like Precedence Constraints

The Tensor Product of Two Codes Is Not Necessarily Robustly Testable

A Continuous-Discontinuous Second-Order Transition in the Satisfiability of Random Horn-SAT Formulas

Mixing Points on a Circle

Derandomized Constructions of k-Wise (Almost) Independent Permutations

Towards Optimal Integrality Gaps for Hypergraph Vertex Cover in the Lovász-Schrijver Hierarchy

Where’s the Winner? Max-Finding and Sorting with Metric Costs

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