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

Abstract : We consider a class of graph problems introduced in a paper of Goemans and Williamson that involve finding forests of minimum edge cost. This class includes a number of location/routing problems; it also includes a problem in which we are given as input a parameter k, and want to find a forest such that each component has at least k vertices. Goemans and Williamson gave a 2-approximation algorithm for this class of problems. We give an improved 3/2-approximation algorithm.
Document type :
Journal articles
Complete list of metadatas

Cited literature [12 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01196842
Contributor : Basile Couëtoux <>
Submitted on : Monday, September 14, 2015 - 1:31:02 PM
Last modification on : Monday, March 4, 2019 - 2:04:14 PM
Long-term archiving on : Tuesday, December 29, 2015 - 12:08:29 AM

File

MathProg2015.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Basile Couëtoux, James M. Davis, David P. Williamson. A 3/2-approximation algorithm for some minimum-cost graph problems. Mathematical Programming B, Springer, 2015, 150 (1), pp.19--34. ⟨10.1007/s10107-013-0727-z⟩. ⟨hal-01196842⟩

Share

Metrics

Record views

230

Files downloads

242