Local ratio with negative weights

Authors:
Reuven Bar-Yehuda;Dror Rawitz
Affiliations:
Department of Computer Science, Technion, Haifa 32000, Israel;Department of Electrical Engineering, Tel-Aviv University, Tel-Aviv 69978, Israel
Venue:
Operations Research Letters
Year:
2004

Citing 4
Cited 3

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
On the Equivalence between the Primal-Dual Schema and the Local-Ratio Technique

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
From Valid Inequalities to Heuristics: a Unified View of Primal-Dual Approximation Algorithms in Covering Problems

Operations Research

Local ratio: A unified framework for approximation algorithms. In Memoriam: Shimon Even 1935-2004

ACM Computing Surveys (CSUR)
A tale of two methods

Theoretical Computer Science
Combination of parallel machine scheduling and vertex cover

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present local ratio interpretations of known algorithms for minimums-tcut and the assignment problem. Our interpretations are the first application of local ratio with negative weights. These interpretations lead to primal-dual analyses that are based on new IP formulations.