Saving an epsilon: A 2-approximation for the k-MST problem in graphs

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2005, Pages 396-402

  Garg, Naveen ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY DELHI   (India)

Author keywords

Approximation Algorithms; Spanning Trees

Indexed keywords

APPROXIMATION ALGORITHMS; SPANNING TREES;

ALGORITHMS; GRAPH THEORY; NUMBER THEORY; PROBLEM SOLVING; TREES (MATHEMATICS);

POLYNOMIAL APPROXIMATION;

EID: 33244493480     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1060590.1060650     Document Type: Conference Paper

References (17)

1. S. Arora. Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems. Journal of the ACM, 45(5):753-782, 1998.
2. S. Arora and G. Karakostas. A 2 + &egr; approximation algorithm for the k-mst problem. In Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms, pages 754-759. Society for Industrial and Applied Mathematics, 2000.
3. S. Arya and H. Ramesh. A 2.5-factor approximation algorithm for the k-mst problem. Information Processing Letters, 65(3):117-118, 1998.
4. B. Awerbuch, Y. Azar, A. Blum, and S. Vempala. Improved approximation guarantees for minimum weight k-trees and prize-collecting salesmen. In Proceedings, ACM Symposium on Theory of Computing, pages 277-283, 1995.
5. N. Bansal, A. Blum, S. Chawla, and A. Meyerson. Approximation algorithms for deadline-tsp and vehicle routing with time-windows. In Proceedings, ACM Symposium on Theory of Computing, 2004.
6. A. Blum, P. Chalasani, and S. Vempala. A constant-factor approximation for the k-mst problem in the plane. In Proceedings, ACM Symposium on Theory of Computing, pages 294-302, 1995.
7. A. Blum, S. Chawla, D. Karger, T. Lane, A. Meyerson, and M. Minkoff. Approximation algorithms for orienteering and discounted-reward tsp. In Proceedings, IEEE Symposium on Foundations of Computer Science, 2003.
8. A. Blum, R. Ravi, and S. Vempala. A constant factor approximation for the k-mst problem. In Proceedings, ACM Symposium on Theory of Computing, pages 442-448, 1996.
9. K. Chaudhuri, B. Godfrey, S. Rao, and K. Talwar. Paths, trees and minimum latency tours. In Proceedings, IEEE Symposium on Foundations of Computer Science, 2004.
10. D. Eppstein. Faster geometric k-point mst approximation. Technical Report 13, University of California, Irvine, CA, 1995.
11. N. Garg. A 3-approximation for the minimum tree spanning k vertices. In Proceedings, IEEE Symposium on Foundations of Computer Science, 1996.
12. N. Garg and D. Hochbaum. An O(log k) approximation algorithm for the k minimum spanning tree problem in the plane. In Proceedings, ACM Symposium on Theory of Computing, 1994.
13. D. Johnson, M. Minkoff, and S. Phillips. The prize collecting steiner tree problem: theory and practice. In Proceedings, ACM-SIAM Symposium on Discrete Algorithms, 2000.
14. J. S. B. Mitchell. Guillotine subdivisions approximate polygonal subdivisions: A simple polynomial-time approximation scheme for geometric TSP, k-MST, and related problems. SIAM Journal on Computing, 28(4):1298-1309, 1999.
15. J. S. B. Mitchell, A. Blum, P. Chalasani, and S. Vempala. A constant-factor approximation algorithm for the geometric k-MST problem in the plane. SIAM Journal on Computing, 28(3):771-781, 1999.
16. S. Rajagopalan and V. V. Vazirani. Logarithmic approximation of minimum weight k trees. Unpublished Manuscript, 1995.
17. R. Ravi, R. Sundaram, M. Marathe, D. Rosenkrantz, and S. Ravi. Spanning trees short and small. In Proceedings, ACM-SIAM Symposium on Discrete Algorithms, 1993.