### 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 (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 language | English (US) |
---|---|

Pages (from-to) | 19-34 |

Number of pages | 16 |

Journal | Mathematical Programming |

Volume | 150 |

Issue number | 1 |

DOIs | |

State | Published - Jan 1 2015 |

### Keywords

- 05C85
- 90C27

### ASJC Scopus subject areas

- Software
- Mathematics(all)

## Fingerprint 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

Couëtoux, B., Davis, J. M., & Williamson, D. P. (2015). A 3/2-approximation algorithm for some minimum-cost graph problems.

*Mathematical Programming*,*150*(1), 19-34. https://doi.org/10.1007/s10107-013-0727-z