Abstract
We discuss two approximation approaches, the primal-dual schema and the local-ratio technique.W e present two relatively simple frameworks, one for each approach, which extend known frameworks for covering problems.W e show that the two are equivalent, and conclude that the integrality gap of an integer program serves as a bound to the approximation ratio when working with the local-ratio technique.
Original language | English |
---|---|
Title of host publication | Approximation, Randomization, and Combinatorial Optimization |
Subtitle of host publication | Algorithms and Techniques - 4th International Workshop on Approximation, Algorithms for Combinatorial Optimization Problems, APPROX 2001 and 5th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2001, Proceedings |
Editors | Luca Trevisan, Klaus Jansen, Michel Goemans, Jose D. P. Rolim |
Publisher | Springer Verlag |
Pages | 24-36 |
Number of pages | 13 |
ISBN (Electronic) | 3540424709 |
State | Published - 2015 |
Externally published | Yes |
Event | 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2001 and 5th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2001 - Berkeley, United States Duration: 18 Aug 2001 → 20 Aug 2001 |
Publication series
Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|
Volume | 2129 |
ISSN (Print) | 0302-9743 |
ISSN (Electronic) | 1611-3349 |
Conference
Conference | 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2001 and 5th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2001 |
---|---|
Country/Territory | United States |
City | Berkeley |
Period | 18/08/01 → 20/08/01 |
Bibliographical note
Publisher Copyright:© Springer-Verlag Berlin Heidelberg 2001