Approximate k-MSTs and k-Steiner trees via the primal-dual method and Lagrangean relaxation

Mathematical Programming

Volumn 100, Issue 2, 2004, Pages 411-421

  Chudak, Fabián A ^a   Roughgarden, Tim ^b   Williamson, David P ^c  

^a ETH ZURICH   (Switzerland)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; GRAPH THEORY; LAGRANGE MULTIPLIERS; MATHEMATICAL MODELS; POLYNOMIALS; PROBLEM SOLVING;

APPROXIMATION ALGORITHMS; GLOBAL CONVERGENCE; LAGRANGEAN RELAXATION; STEINER TREES;

TREES (MATHEMATICS);

EID: 21144453115     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10107-003-0479-2     Document Type: Article

References (18)

1. Arora, S., Karakostas, G.: Approximation Schemes for Minimum Latency Problems. In: Proceedings of the 31st Annual ACM Symposium on the Theory of Computing, 1999, pp. 688-693
2. Arora, S., Karakostas, G.: A 2 + ε Approximation Algorithm for the k-MST Problem. In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, 2000, pp. 754-759
3. Arya, S., Ramesh, H.: A 2.5-factor approximation algorithm for the k-MST problem. Inf. Process. Lett. 65, 117-118 (1998)
4. Awerbuch, B., Azar, Y., Blum, A., Vempala, S.: Improved Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen. SIAM J. Com. 28(1), 254-262 (1999)
5. Bern, M., Plassmann, P.: The Steiner Problem with Edge Lengths 1 and 2. Inf. Process. Lett. 32, 171-176 (1989)
6. Blum, A., Chalasani, P., Coppersmith, D., Pulleyblank, W., Raghavan, P., Sudan, M.: The Minimum Latency Problem. In: Proceedings of the 26th Annual ACM Symposium on the Theory of Computing, 1994, pp. 163-171
7. Blum, A., Ravi, R., Vempala, S.: A Constant-Factor Approximation Algorithm for the k-MST Problem. J. Comput. Syst. Sci. 58(1), 101-108 (1999)
8. Charikar, M., Guha, S.: Improved Combinatorial Algorithms for the Facility Location and k-Median Problems. In: Proceedings of the 40th Annual Symposium on Foundations of Computer Science, 1999, pp. 378-388
9. Fischetti, M., Hamacher, H., Jørnsten, K., Maffioli, F.: Weighted k-Cardinality Trees: Complexity and Polyhedral Structure. Networks 24, 11-21 (1994)
10. Garg, N.: A 3-Approximation for the Minimum Tree Spanning k Vertices. In: Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 1996, pp. 302-309
11. Garg, N: Personal communication. 1999
12. Goemans, M., Kleinberg, J.: An improved approximation ratio for the minimum latency problem. Math. Program. 82, 111-124 (1998)
13. Goemans, M.X., Williamson, D.P.: A General Approximation Technique for Constrained Forest Problems. SIAM J. Com. 24, 296-317 (1995)
14. Goemans, M.X. Williamson, D.P.: The Primal-Dual Method for Approximation Algorithms and Its Application to Network Design Problems. In: Approximation Algorithms for NP-Hard Problems, D.S. Hochbaum (ed.), chapter 4, PWS Publishing Company, 1997, pp. 144-191
15. Jain, K., Vazirani, V. V.: Primal-Dual Approximation Algorithms for Metric Facility Location and k-Median Problems. J. ACM 48, 274-296 (2001)
16. Jain, K., Mahdian, M., Saberi, A.: A new greedy approach for facility location problems. In: Proceedings of the 34th Annual ACM Symposium on the Theory of Computing, 2002, pp. 731-740
17. Rajagopalan, S., Vazirani, V.V.: Logarithmic approximation of minimum weight k trees. Unpublished manuscript, 1995
18. Ravi, R., Sundaram, R., Marathe, M.V., Rosenkrantz, D.J., Ravi, S.S.: Spanning Trees Short or Small. SIAM J. Disc. Math. 9, 178-200 (1996)