A dual-fitting 3/2-approximation algorithm for some minimum-cost graph problems

Authors:
James M. Davis;David P. Williamson
Affiliations:
School of Operations Research and Information Engineering, Cornell University, Ithaca, NY;School of Operations Research and Information Engineering, Cornell University, Ithaca, NY
Venue:
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Year:
2012

Citing 8
Cited 0

A General Approximation Technique for Constrained Forest Problems

SIAM Journal on Computing
The primal-dual method for approximation algorithms and its application to network design problems

Approximation algorithms for NP-hard problems
Communication: A class of heuristics for the constrained forest problem

Discrete Applied Mathematics
Complexity and approximation of the Constrained Forest problem

Theoretical Computer Science
A 3/2 approximation for a constrained forest problem

ESA'11 Proceedings of the 19th European conference on Algorithms
A greedy heuristic for a minimum-weight forest problem

Operations Research Letters
Approximating minimum-cost graph problems with spanning tree edges

Operations Research Letters
Another greedy heuristic for the constrained forest problem

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

In an ESA 2011 paper, Couëtoux [2] gives a beautiful $\frac{3}{2}$-approximation algorithm for the problem of finding a minimum-cost set of edges such that each connected component has at least k vertices in it. The algorithm improved on previous 2-approximation algorithms for the problem. In this paper, we reanalyze Couëtoux's algorithm using dual-fitting and show how to generalize the algorithm to a broader class of graph problems previously considered in the literature.