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

9783540424703, 9783540446668

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Online Weighted Flow Time and Deadline Scheduling

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

10.1007/3-540-44666-4_8 ◽

2001 ◽

pp. 36-47 ◽

Cited By ~ 13

Author(s):

Luca Becchetti ◽

Stefano Leonardi ◽

Alberto Marchetti-Spaccamela ◽

Kirk R. Pruhs

Keyword(s):

Flow Time ◽

Deadline Scheduling

Download Full-text

Error-Correcting Codes and Pseudorandom Projections

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

10.1007/3-540-44666-4_4 ◽

2001 ◽

pp. 7-9 ◽

Cited By ~ 1

Author(s):

Luca Trevisan

Keyword(s):

Error Correcting Codes

Download Full-text

On a Generalized Ruin Problem

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

10.1007/3-540-44666-4_21 ◽

2001 ◽

pp. 181-191 ◽

Cited By ~ 1

Author(s):

Kazuyuki Amano ◽

John Tromp ◽

Paul M. B. Vitányi ◽

Osamu Watanabe

Keyword(s):

Ruin Problem

Download Full-text

Hill-Climbing vs. Simulated Annealing for Planted Bisection Problems

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

10.1007/3-540-44666-4_2 ◽

2001 ◽

pp. 2-5

Author(s):

Russell Impagliazzo

Keyword(s):

Simulated Annealing ◽

Hill Climbing

Download Full-text

Some Approximation Results for the Maximum Agreement Forest Problem

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

10.1007/3-540-44666-4_19 ◽

2001 ◽

pp. 159-169 ◽

Cited By ~ 9

Author(s):

Estela Maris Rodrigues ◽

Marie-France Sagot ◽

Yoshiko Wakabayashi

Keyword(s):

Maximum Agreement Forest

Download Full-text

Approximation Algorithms for Budget-Constrained Auctions

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

10.1007/3-540-44666-4_14 ◽

2001 ◽

pp. 102-113 ◽

Cited By ~ 7

Author(s):

Rahul Garg ◽

Vijay Kumar ◽

Vinayaka Pandit

Keyword(s):

Approximation Algorithms

Download Full-text

A Greedy Facility Location Algorithm Analyzed Using Dual Fitting

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

10.1007/3-540-44666-4_16 ◽

2001 ◽

pp. 127-137 ◽

Cited By ~ 23

Author(s):

Mohammad Mahdian ◽

Evangelos Markakis ◽

Amin Saberi ◽

Vijay Vazirani

Keyword(s):

Facility Location ◽

Location Algorithm

Download Full-text

Approximation Schemes for Ordered Vector Packing Problems

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

10.1007/3-540-44666-4_11 ◽

2001 ◽

pp. 63-75 ◽

Cited By ~ 1

Author(s):

Alberto Caprara ◽

Hans Kellerer ◽

Ulrich Pferschy

Keyword(s):

Approximation Schemes ◽

Packing Problems

Download Full-text

Equitable Coloring Extends Chernoff-Hoeffding Bounds

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

10.1007/3-540-44666-4_31 ◽

2001 ◽

pp. 285-296 ◽

Cited By ~ 21

Author(s):

Sriram V. Pemmaraju

Keyword(s):

Equitable Coloring ◽

Hoeffding Bounds

Download Full-text

On the Derandomization of Constant Depth Circuits

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

10.1007/3-540-44666-4_28 ◽

2001 ◽

pp. 249-260 ◽

Cited By ~ 5

Author(s):

Adam R. Klivans

Keyword(s):

Constant Depth ◽

Constant Depth Circuits

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

Online Weighted Flow Time and Deadline Scheduling

Error-Correcting Codes and Pseudorandom Projections

On a Generalized Ruin Problem

Hill-Climbing vs. Simulated Annealing for Planted Bisection Problems

Some Approximation Results for the Maximum Agreement Forest Problem

Approximation Algorithms for Budget-Constrained Auctions

A Greedy Facility Location Algorithm Analyzed Using Dual Fitting

Approximation Schemes for Ordered Vector Packing Problems

Equitable Coloring Extends Chernoff-Hoeffding Bounds

On the Derandomization of Constant Depth Circuits

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