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

Mathematical Programming

Volumn 107, Issue 3, 2006, Pages 491-504

  Arora, Sanjeev ^a   Karakostas, George ^b  

^a Princeton University   (United States)

^b MCMASTER UNIVERSITY   (Canada)

Author keywords

Approximation algorithm; k Minimum Spanning Tree; Primal Dual schema

Indexed keywords

APPROXIMATION THEORY; GRAPH THEORY; MATHEMATICAL PROGRAMMING; PROBLEM SOLVING;

APPROXIMATION ALGORITHM; K-MINIMUM SPANNING TREE; PRIMAL-DUAL SCHEMA;

ALGORITHMS;

EID: 33645320814     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-005-0693-1     Document Type: Article

References (21)

1. Agrawal, A., Klein, P., Ravi, R.: When trees collide: An approximation algorithm for the generalized Steiner problem on networks. SIAM J. Comput, 24 (3), 440-456 (1995)
2. Archer, A., Williamson, D.P.: Faster approximation algorithms for the minimum latency problem. In: Proceedings of 14th ACM-SIAM Symp. on Discrete Algorithms (SODA), 2003, pp. 88-96
3. Arora, S.: Polynomial-time approximation schemes for Euclidean TSP and other geometric problems. J. ACM 45 (5), 1-30, (1998)
4. Preliminary versions in Proceedings of 37th IEEE Symp. on Foundations of Computer Science (FOCS), pp. 2-12, 1996
5. and in Proceedings of 38th IEEE Symp. on Foundations of Computer Science (FOCS), 1997, pp. 554-563
6. Arya, S., Ramesh, H.:2.5-factor approximation algorithm for the k-MST problem. Information Processing Letters 65 (3), 117-118 (1998)
7. Awerbuch, B., Azar, Y., Blum, A., Vempala, S.: New approximation guarantees for minimum weight k-trees and prize-collecting salesmen. SIAM J. Comput. 28 (1), 254-262 (1998)
8. Blum, A., Chalasani, P., Coppersmith, D., Pulleyblank, B., Raghavan, P., Sudan, M.: The minimum latency problem. In: Proceedings of 26th ACM Symp. on Theory Of Computing (STOC), 1994, pp. 163-171
9. Blum, A., Ravi, R., Vempala, S.: A constant factor approximation for the k-MST problem. J. Comput. Syst. Sci. 58(1), 101-108 (1999)
10. Chaudhuri, K., Godfrey, B., Rao, S., Talwar, K.: Paths, trees and minimum latency tours. In: Proceedings of 44th IEEE Symp. on Foundations of Computer Science (FOCS), 2003, pp. 36-45
11. Fischetti, M., Hamacher, H.W., Jörnsten, K., Maffioli, F.: Weighted k-cardinality trees: complexity and polyhedral structure. Networks 24, 11-21 (1994)
12. Garg, N.: A 3-approximation for the minimum tree spanning k vertices. In: Proceedings of 37th IEEE Symp. on Foundations of Computer Science (FOCS), 1996, pp. 302-309
13. Garg, N.: Saving an ε: a 2-approximation for the k-MST problem in graphs. In: Proceedings of 37th ACM Symposium on Theory of Computing (STOC), 2005 pp. 396-402
14. Goemans, M., Kleinberg, J.: An improved approximation ratio for the minimum latency problem. Math. Prog. 82, 111-124 (1998)
15. Goemans, M., Williamson, D.: A general approximation technique for constrained forest problems. SLAM J. Comput. 24 (2), 296-317 (1995)
16. Hockbaum, D.: Approximation algorithms for NP-hard problems. PWS Publishing Company, 1997
17. Mitchell, J.S.B.: Guillotine subdivisions spproximate polygonal subdivisions: A simple polynomial-time approximation scheme for geometric TSP, k-MST, and related problems. SIAM J. Comput. 28 (4), 1298-1309 (1999)
18. Rajagopalan, S., Vazirani, V.V.: Logarithmic approximation of minimum weight k-trees. Unpublished manuscript, 1995
19. Ravi, R., Sundaram, R., Marathe, M., Rosenkrantz, D., Ravi, S.: Spanning trees short and small. SIAM J. Disc. Math. 9 (2), 178-200 (1996)
20. Vazirani, V.V.: Approximation algorithms. Springer-Verlag, 2001
21. Zelikovsky, A., Lozevanu, D.: Minimal and bounded trees. In: Tezele Cong. XVIII Acad. Romano-Americane, 1993, pp. 25-26