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

9783642325113, 9783642325120

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Tight Bounds for Testing k-Linearity

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

10.1007/978-3-642-32512-0_37 ◽

2012 ◽

pp. 435-446 ◽

Cited By ~ 7

Author(s):

Eric Blais ◽

Daniel Kane

Download Full-text

New and Improved Bounds for the Minimum Set Cover Problem

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

10.1007/978-3-642-32512-0_25 ◽

2012 ◽

pp. 288-300 ◽

Cited By ~ 1

Author(s):

Rishi Saket ◽

Maxim Sviridenko

Keyword(s):

Set Cover ◽

Set Cover Problem ◽

Cover Problem

Download Full-text

On the Coin Weighing Problem with the Presence of Noise

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

10.1007/978-3-642-32512-0_40 ◽

2012 ◽

pp. 471-482 ◽

Cited By ~ 1

Author(s):

Nader H. Bshouty

Download Full-text

What’s the Frequency, Kenneth?: Sublinear Fourier Sampling Off the Grid

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

10.1007/978-3-642-32512-0_6 ◽

2012 ◽

pp. 61-72 ◽

Cited By ~ 14

Author(s):

Petros Boufounos ◽

Volkan Cevher ◽

Anna C. Gilbert ◽

Yi Li ◽

Martin J. Strauss

Keyword(s):

Fourier Sampling

Download Full-text

Approximation Algorithm for Non-boolean MAX k-CSP

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

10.1007/978-3-642-32512-0_22 ◽

2012 ◽

pp. 254-265 ◽

Cited By ~ 1

Author(s):

Konstantin Makarychev ◽

Yury Makarychev

Keyword(s):

Approximation Algorithm

Download Full-text

Approximating Minimum-Cost Connected T-Joins

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

10.1007/978-3-642-32512-0_10 ◽

2012 ◽

pp. 110-121 ◽

Cited By ~ 2

Author(s):

Joseph Cheriyan ◽

Zachary Friggstad ◽

Zhihan Gao

Keyword(s):

Minimum Cost

Download Full-text

iBGP and Constrained Connectivity

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

10.1007/978-3-642-32512-0_11 ◽

2012 ◽

pp. 122-133 ◽

Cited By ~ 1

Author(s):

Michael Dinitz ◽

Gordon Wilfong

Download Full-text

A New Point of NP-Hardness for 2-to-1 Label Cover

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

10.1007/978-3-642-32512-0_1 ◽

2012 ◽

pp. 1-12 ◽

Cited By ~ 1

Author(s):

Per Austrin ◽

Ryan O’Donnell ◽

John Wright

Keyword(s):

Np Hardness

Download Full-text

Prize-Collecting Survivable Network Design in Node-Weighted Graphs

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

10.1007/978-3-642-32512-0_9 ◽

2012 ◽

pp. 98-109 ◽

Cited By ~ 7

Author(s):

Chandra Chekuri ◽

Alina Ene ◽

Ali Vakilian

Keyword(s):

Network Design ◽

Weighted Graphs ◽

Survivable Network Design ◽

Survivable Network ◽

Prize Collecting

Download Full-text

Testing Permanent Oracles – Revisited

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

10.1007/978-3-642-32512-0_31 ◽

2012 ◽

pp. 362-373

Author(s):

Sanjeev Arora ◽

Arnab Bhattacharyya ◽

Rajsekar Manokaran ◽

Sushant Sachdeva

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

Tight Bounds for Testing k-Linearity

New and Improved Bounds for the Minimum Set Cover Problem

On the Coin Weighing Problem with the Presence of Noise

What’s the Frequency, Kenneth?: Sublinear Fourier Sampling Off the Grid

Approximation Algorithm for Non-boolean MAX k-CSP

Approximating Minimum-Cost Connected T-Joins

iBGP and Constrained Connectivity

A New Point of NP-Hardness for 2-to-1 Label Cover

Prize-Collecting Survivable Network Design in Node-Weighted Graphs

Testing Permanent Oracles – Revisited

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