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

Basile Couëtoux, James M. Davis, David P. Williamson

Research output: Contribution to journalArticlepeer-review


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 (Formula presented.)(Formula presented.), and want to find a forest such that each component has at least (Formula presented.)(Formula presented.)vertices. Goemans and Williamson gave a 2-approximation algorithm for this class of problems. We give an improved 3/2-approximation algorithm.

Original languageEnglish (US)
Pages (from-to)19-34
Number of pages16
JournalMathematical Programming
Issue number1
StatePublished - Apr 2015
Externally publishedYes


  • 05C85
  • 90C27

ASJC Scopus subject areas

  • Software
  • Mathematics(all)


Dive into the research topics of 'A 3/2-approximation algorithm for some minimum-cost graph problems'. Together they form a unique fingerprint.

Cite this