Approximating minimum-cost graph problems with spanning tree edges

Authors:
Michel X. Goemans;David P. Williamson
Affiliations:
Department of Mathematics, Room 2-382, Massachusetts Institute of Technology, Cambridge, MA 02139, USA;School of Operations Research and Industrial Engineering, 237 ETC Building, Cornell University, Ithaca, NY 14853, USA
Venue:
Operations Research Letters
Year:
1994

Citing 6
Cited 1

Computational geometry: an introduction

Computational geometry: an introduction
Fibonacci heaps and their uses in improved network optimization algorithms

Journal of the ACM (JACM)
A general approximation technique for constrained forest problems

SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
A primal-dual approximation algorithm for generalized Steiner network problems

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
On the design of approximation algorithms for a class of graph problems

On the design of approximation algorithms for a class of graph problems
A greedy heuristic for a minimum-weight forest problem

Operations Research Letters

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

ESA'12 Proceedings of the 20th Annual European conference on Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

Building on work of Imielinska, Kalantari and Khachiyan, we show how to find approximate solutions for a class of NP-hard minimum-cost graph problems using only edges of a minimum-cost spanning tree. Some consequences of this work are fast 2-approximation algorithms for the 2-matching problem and its variants, as well as for simple location-routing problems.