A tale of two methods

Authors:
Reuven Bar-Yehuda;Dror Rawitz
Affiliations:
Department of Computer Science, Technion, Haifa, Israel;Caesarea Rothschild Institute, University of Haifa, Haifa, Israel
Venue:
Theoretical Computer Science
Year:
2006

Citing 22
Cited 0

Combinatorial optimization: algorithms and complexity

Combinatorial optimization: algorithms and complexity
Linear programming

Linear programming
When Trees Collide: An Approximation Algorithm for theGeneralized Steiner Problem on Networks

SIAM Journal on Computing
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 unified approximation algorithm for node-deletion problems

Discrete Applied Mathematics
A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem

SIAM Journal on Discrete Mathematics
Approximation algorithms for metric facility location and k-Median problems using the primal-dual schema and Lagrangian relaxation

Journal of the ACM (JACM)
Approximation algorithms

Approximation algorithms
A unified approach to approximating resource allocation and scheduling

Journal of the ACM (JACM)
Scheduling split intervals

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Throughput maximization of real-time scheduling with batching

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
From Valid Inequalities to Heuristics: a Unified View of Primal-Dual Approximation Algorithms in Covering Problems

Operations Research
Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP

Journal of the ACM (JACM)
Capacitated vertex covering

Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms
Local ratio: A unified framework for approximation algorithms. In Memoriam: Shimon Even 1935-2004

ACM Computing Surveys (CSUR)
On the Equivalence between the Primal-Dual Schema and the Local Ratio Technique

SIAM Journal on Discrete Mathematics
Using fractional primal-dual to schedule split intervals with demands

ESA'05 Proceedings of the 13th annual European conference on Algorithms
A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs

Operations Research Letters
Local ratio with negative weights

Operations Research Letters

Quantified Score

Hi-index	5.23

Visualization

Abstract

We describe two widely used methods for the design and analysis of approximation algorithms, the primal-dual schema and the local ratio technique. We focus on the creation of both methods by revisiting two results by Bar-Yehuda and Even—the linear time primal-dual approximation algorithm for set cover, and its local ratio interpretation. We also follow the evolution of the two methods by discussing more recent studies.