A General Approximation Technique For Constrained Forest Problems

A General Approximation Technique For Constrained Forest Problems (1992)

Cached

Download Links

[www.almaden.ibm.com]
[theory.lcs.mit.edu]

Other Repositories/Bibliography

CiteULike
DBLP

by Michel Goemans , David P. Williamson

Venue:	SIAM JOURNAL ON COMPUTING
Citations:	308 - 20 self

Versions

Version History

Metadata Version 4

User correction supplied by mph

Datum	Value	Source
TITLE	A General Approximation Technique For Constrained Forest Problems	user correction - Legacy Corrections
AUTHOR NAME	Michel Goemans	user correction
AUTHOR AFFIL	y	user correction
AUTHOR NAME	David P. Williamson	user correction
AUTHOR AFFIL	2; log n) time compares favorably with the best strongly polynomial exact algorithms running in; O(n; 3	user correction
ABSTRACT	We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph with trees, cycles or paths satisfying certain requirements. In particular, many basic combinatorial optimization problems fit in this framework, including the shortest path, minimum-cost spanning tree, minimum-weight perfect matching, traveling salesman and Steiner tree problems. Our techniqueproduces approximation algorithms that run in O(n² log n) time and come within a factor of 2 of optimal for most of these problems. For instance, we obtain a 2-approximationalgorithm for the minimum-weight perfect matching problem under the triangle inequality. Our running time of O(n² log n) time compares favorably with the best strongly polynomial exact algorithms running in O(n³) time for dense graphs. A similar result is obtained for the 2-matchingproblem and its variants. We also derive the first approxi...	user correction
YEAR	1992	user correction - Legacy Corrections
VENUE	SIAM JOURNAL ON COMPUTING	user correction
VENUE TYPE	JOURNAL	INFERENCE
PAGES	296--317	INFERENCE
VOLUME	24	INFERENCE
CITATIONS	40 found	ParsCit 1.0