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

9783540853626, 9783540853633

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Quantum and Randomized Lower Bounds for Local Search on Vertex-Transitive Graphs

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

10.1007/978-3-540-85363-3_31 ◽

2008 ◽

pp. 385-401

Author(s):

Hang Dinh ◽

Alexander Russell

Keyword(s):

Local Search ◽

Lower Bounds ◽

Vertex Transitive ◽

Vertex Transitive Graphs ◽

Transitive Graphs

Download Full-text

Approximately Counting Embeddings into Random Graphs

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

10.1007/978-3-540-85363-3_33 ◽

2008 ◽

pp. 416-429 ◽

Cited By ~ 2

Author(s):

Martin Fürer ◽

Shiva Prasad Kasiviswanathan

Keyword(s):

Random Graphs

Download Full-text

Streaming Algorithms for k-Center Clustering with Outliers and with Anonymity

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

10.1007/978-3-540-85363-3_14 ◽

2008 ◽

pp. 165-178 ◽

Cited By ~ 12

Author(s):

Richard Matthew McCutchen ◽

Samir Khuller

Keyword(s):

Streaming Algorithms

Download Full-text

Approximating Single Machine Scheduling with Scenarios

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

10.1007/978-3-540-85363-3_13 ◽

2008 ◽

pp. 153-164 ◽

Cited By ~ 3

Author(s):

Monaldo Mastrolilli ◽

Nikolaus Mutsanas ◽

Ola Svensson

Keyword(s):

Single Machine ◽

Machine Scheduling ◽

Single Machine Scheduling

Download Full-text

Connected Vertex Covers in Dense Graphs

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

10.1007/978-3-540-85363-3_4 ◽

2008 ◽

pp. 35-48 ◽

Cited By ~ 1

Author(s):

Jean Cardinal ◽

Eythan Levy

Keyword(s):

Dense Graphs ◽

Connected Vertex

Download Full-text

Learning Random Monotone DNF

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

10.1007/978-3-540-85363-3_38 ◽

2008 ◽

pp. 483-497 ◽

Cited By ~ 3

Author(s):

Jeffrey C. Jackson ◽

Homin K. Lee ◽

Rocco A. Servedio ◽

Andrew Wan

Download Full-text

The Complexity of Distinguishing Markov Random Fields

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

10.1007/978-3-540-85363-3_27 ◽

2008 ◽

pp. 331-342 ◽

Cited By ~ 8

Author(s):

Andrej Bogdanov ◽

Elchanan Mossel ◽

Salil Vadhan

Keyword(s):

Random Fields ◽

Markov Random Fields ◽

Markov Random

Download Full-text

Small Sample Spaces Cannot Fool Low Degree Polynomials

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

10.1007/978-3-540-85363-3_22 ◽

2008 ◽

pp. 266-275 ◽

Cited By ~ 3

Author(s):

Noga Alon ◽

Ido Ben-Eliezer ◽

Michael Krivelevich

Keyword(s):

Small Sample ◽

Low Degree ◽

Low Degree Polynomials

Download Full-text

Approximating Maximum Subgraphs without Short Cycles

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

10.1007/978-3-540-85363-3_10 ◽

2008 ◽

pp. 118-131 ◽

Cited By ~ 4

Author(s):

Guy Kortsarz ◽

Michael Langberg ◽

Zeev Nutov

Download Full-text

Approximating Optimal Binary Decision Trees

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

10.1007/978-3-540-85363-3_1 ◽

2008 ◽

pp. 1-9 ◽

Cited By ~ 8

Author(s):

Micah Adler ◽

Brent Heeringa

Keyword(s):

Decision Trees ◽

Binary Decision ◽

Binary Decision Trees

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

Quantum and Randomized Lower Bounds for Local Search on Vertex-Transitive Graphs

Approximately Counting Embeddings into Random Graphs

Streaming Algorithms for k-Center Clustering with Outliers and with Anonymity

Approximating Single Machine Scheduling with Scenarios

Connected Vertex Covers in Dense Graphs

Learning Random Monotone DNF

The Complexity of Distinguishing Markov Random Fields

Small Sample Spaces Cannot Fool Low Degree Polynomials

Approximating Maximum Subgraphs without Short Cycles

Approximating Optimal Binary Decision Trees

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