A 3/2-approximation algorithm for some minimum-cost graph problems - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Mathematical Programming Année : 2015

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

Résumé

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.
Fichier principal
Vignette du fichier
MathProg2015.pdf (165.66 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01196842 , version 1 (14-09-2015)

Identifiants

Citer

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

Altmetric

Partager

Gmail Facebook X LinkedIn More