On the equivalence between the primal-dual schema and the local-ratio technique

Reuven Bar-Yehuda; Dror Rawitz

On the equivalence between the primal-dual schema and the local-ratio technique

Reuven Bar-Yehuda
, Dror Rawitz

Technion-Israel Institute of Technology

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

1 Scopus citations

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

Cite this

Bar-Yehuda, R., & Rawitz, D. (2015). On the equivalence between the primal-dual schema and the local-ratio technique. In L. Trevisan, K. Jansen, M. Goemans, & J. D. P. Rolim (Eds.), Approximation, Randomization, and Combinatorial Optimization: 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 (pp. 24-36). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2129). Springer Verlag.

Bar-Yehuda, Reuven ; Rawitz, Dror. / On the equivalence between the primal-dual schema and the local-ratio technique. Approximation, Randomization, and Combinatorial Optimization: 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. editor / Luca Trevisan ; Klaus Jansen ; Michel Goemans ; Jose D. P. Rolim. Springer Verlag, 2015. pp. 24-36 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{2160df8ed41343d98cf6a26afd9dd179,

title = "On the equivalence between the primal-dual schema and the local-ratio technique",

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.",

author = "Reuven Bar-Yehuda and Dror Rawitz",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2001; 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 ; Conference date: 18-08-2001 Through 20-08-2001",

year = "2015",

language = "אנגלית",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "24--36",

editor = "Luca Trevisan and Klaus Jansen and Michel Goemans and Rolim, \{Jose D. P.\}",

booktitle = "Approximation, Randomization, and Combinatorial Optimization",

address = "גרמניה",

}

Bar-Yehuda, R & Rawitz, D 2015, On the equivalence between the primal-dual schema and the local-ratio technique. in L Trevisan, K Jansen, M Goemans & JDP Rolim (eds), Approximation, Randomization, and Combinatorial Optimization: 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. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2129, Springer Verlag, pp. 24-36, 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, 18/08/01.

On the equivalence between the primal-dual schema and the local-ratio technique. / Bar-Yehuda, Reuven; Rawitz, Dror.
Approximation, Randomization, and Combinatorial Optimization: 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. ed. / Luca Trevisan; Klaus Jansen; Michel Goemans; Jose D. P. Rolim. Springer Verlag, 2015. p. 24-36 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2129).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - On the equivalence between the primal-dual schema and the local-ratio technique

AU - Bar-Yehuda, Reuven

AU - Rawitz, Dror

N1 - Publisher Copyright: © Springer-Verlag Berlin Heidelberg 2001

PY - 2015

Y1 - 2015

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/84923096790

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84923096790

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 24

EP - 36

BT - Approximation, Randomization, and Combinatorial Optimization

A2 - Trevisan, Luca

A2 - Jansen, Klaus

A2 - Goemans, Michel

A2 - Rolim, Jose D. P.

PB - Springer Verlag

T2 - 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

Y2 - 18 August 2001 through 20 August 2001

ER -

Bar-Yehuda R, Rawitz D. On the equivalence between the primal-dual schema and the local-ratio technique. In Trevisan L, Jansen K, Goemans M, Rolim JDP, editors, Approximation, Randomization, and Combinatorial Optimization: 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. Springer Verlag. 2015. p. 24-36. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

On the equivalence between the primal-dual schema and the local-ratio technique

Abstract

Publication series

Conference

Bibliographical note

Other files and links

Fingerprint

Cite this