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

9783642403279, 9783642403286

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Partial Interval Set Cover – Trade-Offs between Scalability and Optimality

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

10.1007/978-3-642-40328-6_9 ◽

2013 ◽

pp. 110-125 ◽

Cited By ~ 3

Author(s):

Katherine Edwards ◽

Simon Griffiths ◽

William Sean Kennedy

Keyword(s):

Set Cover ◽

Trade Offs ◽

Partial Interval

Download Full-text

Generalizing the Layering Method of Indyk and Woodruff: Recursive Sketches for Frequency-Based Vectors on Streams

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

10.1007/978-3-642-40328-6_5 ◽

2013 ◽

pp. 58-70 ◽

Cited By ~ 9

Author(s):

Vladimir Braverman ◽

Rafail Ostrovsky

Download Full-text

A Tight Lower Bound for High Frequency Moment Estimation with Small Error

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

10.1007/978-3-642-40328-6_43 ◽

2013 ◽

pp. 623-638 ◽

Cited By ~ 6

Author(s):

Yi Li ◽

David P. Woodruff

Keyword(s):

Lower Bound ◽

High Frequency ◽

Small Error ◽

Moment Estimation

Download Full-text

Finding Heavy Hitters from Lossy or Noisy Data

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

10.1007/978-3-642-40328-6_25 ◽

2013 ◽

pp. 347-362 ◽

Cited By ~ 3

Author(s):

Lucia Batman ◽

Russell Impagliazzo ◽

Cody Murray ◽

Ramamohan Paturi

Keyword(s):

Noisy Data ◽

Heavy Hitters

Download Full-text

The Approximability of the Binary Paintshop Problem

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

10.1007/978-3-642-40328-6_15 ◽

2013 ◽

pp. 205-217 ◽

Cited By ~ 1

Author(s):

Anupam Gupta ◽

Satyen Kale ◽

Viswanath Nagarajan ◽

Rishi Saket ◽

Baruch Schieber

Download Full-text

Improved FPTAS for Multi-spin Systems

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

10.1007/978-3-642-40328-6_44 ◽

2013 ◽

pp. 639-654 ◽

Cited By ~ 8

Author(s):

Pinyan Lu ◽

Yitong Yin

Keyword(s):

Spin Systems

Download Full-text

Combinatorial Limitations of Average-Radius List Decoding

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

10.1007/978-3-642-40328-6_41 ◽

2013 ◽

pp. 591-606 ◽

Cited By ~ 3

Author(s):

Venkatesan Guruswami ◽

Srivatsan Narayanan

Keyword(s):

Average Radius ◽

List Decoding

Download Full-text

Conditional Random Fields, Planted Constraint Satisfaction and Entropy Concentration

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

10.1007/978-3-642-40328-6_24 ◽

2013 ◽

pp. 332-346 ◽

Cited By ~ 13

Author(s):

Emmanuel Abbe ◽

Andrea Montanari

Keyword(s):

Constraint Satisfaction ◽

Random Fields ◽

Conditional Random Fields

Download Full-text

A Pseudo-approximation for the Genus of Hamiltonian Graphs

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

10.1007/978-3-642-40328-6_18 ◽

2013 ◽

pp. 244-259 ◽

Cited By ~ 1

Author(s):

Yury Makarychev ◽

Amir Nayyeri ◽

Anastasios Sidiropoulos

Keyword(s):

Hamiltonian Graphs

Download Full-text

Approximate Indexability and Bandit Problems with Concave Rewards and Delayed Feedback

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

10.1007/978-3-642-40328-6_14 ◽

2013 ◽

pp. 189-204

Author(s):

Sudipto Guha ◽

Kamesh Munagala

Keyword(s):

Delayed Feedback ◽

Bandit Problems

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

Partial Interval Set Cover – Trade-Offs between Scalability and Optimality

Generalizing the Layering Method of Indyk and Woodruff: Recursive Sketches for Frequency-Based Vectors on Streams

A Tight Lower Bound for High Frequency Moment Estimation with Small Error

Finding Heavy Hitters from Lossy or Noisy Data

The Approximability of the Binary Paintshop Problem

Improved FPTAS for Multi-spin Systems

Combinatorial Limitations of Average-Radius List Decoding

Conditional Random Fields, Planted Constraint Satisfaction and Entropy Concentration

A Pseudo-approximation for the Genus of Hamiltonian Graphs

Approximate Indexability and Bandit Problems with Concave Rewards and Delayed Feedback

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