A 2 + ɛ approximation algorithm for the k-MST problem

Authors:
Sanjeev Arora;George Karakostas
Affiliations:
Department of Computer Science, Princeton University, USA;Department of Computing & Software, McMaster University, Canada
Venue:
Mathematical Programming: Series A and B
Year:
2006

Citing 0
Cited 4

Implicit branching and parameterized partial cover problems

Journal of Computer and System Sciences
Improved Approximation Algorithms for Prize-Collecting Steiner Tree and TSP

SIAM Journal on Computing
Prize-collecting Steiner problems on planar graphs

Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Improved algorithms for orienteering and related problems

ACM Transactions on Algorithms (TALG)

Quantified Score

Hi-index	0.00

Visualization

Abstract

For any ɛ 0 we give a (2 + ɛ)-approximation algorithm for the problem of finding a minimum tree spanning any k vertices in a graph (k-MST), improving a 3-approximation algorithm by Garg [10]. As in [10] the algorithm extends to a (2 + ɛ)-approximation algorithm for the minimum tour that visits any k vertices, provided the edge costs satisfy the triangle inequality.