On the Equivalence between the Primal-Dual Schema and the Local-Ratio Technique

Authors:
Reuven Bar-Yehuda;Dror Rawitz
Affiliations:
-;-
Venue:
APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization
Year:
2001

Citing 8
Cited 5

A General Approximation Technique for Constrained Forest Problems

SIAM Journal on Computing
Approximation algorithms for NP-hard problems

Approximation algorithms for NP-hard problems
The primal-dual method for approximation algorithms and its application to network design problems

Approximation algorithms for NP-hard problems
A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem

SIAM Journal on Discrete Mathematics
A unified approach to approximating resource allocation and scheduling

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
From Valid Inequalities to Heuristics: a Unified View of Primal-Dual Approximation Algorithms in Covering Problems

Operations Research
Primal-Dual Approximation Algorithms for Metric Facility Location and k-Median Problems

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs

Operations Research Letters

Further reflections on a theory for basic algorithms

AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
How well can primal-dual and local-ratio algorithms perform?

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Exploiting locality: approximating sorting buffers

WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
Local ratio with negative weights

Operations Research Letters
Combination of parallel machine scheduling and vertex cover

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

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