Skip to main content

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

Abstract.

Garg [10] gives two approximation algorithms for the minimum-cost tree spanning k vertices in an undirected graph. Recently Jain and Vazirani [15] discovered primal-dual approximation algorithms for the metric uncapacitated facility location and k-median problems. In this paper we show how Garg’s algorithms can be explained simply with ideas introduced by Jain and Vazirani, in particular via a Lagrangean relaxation technique together with the primal-dual method for approximation algorithms. We also derive a constant factor approximation algorithm for the k-Steiner tree problem using these ideas, and point out the common features of these problems that allow them to be solved with similar techniques.

This is a preview of subscription content, access via your institution.

References

  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)

    Google Scholar 

  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)

    Article  MATH  Google Scholar 

  5. Bern, M., Plassmann, P.: The Steiner Problem with Edge Lengths 1 and 2. Inf. Process. Lett. 32, 171–176 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  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)

    Google Scholar 

  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)

    MathSciNet  MATH  Google Scholar 

  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)

    Article  MathSciNet  Google Scholar 

  13. Goemans, M.X., Williamson, D.P.: A General Approximation Technique for Constrained Forest Problems. SIAM J. Com. 24, 296–317 (1995)

    MathSciNet  MATH  Google Scholar 

  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)

    Google Scholar 

  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)

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to David P. Williamson.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Chudak, F., Roughgarden, T. & Williamson, D. Approximate k-MSTs and k-Steiner trees via the primal-dual method and Lagrangean relaxation. Math. Program., Ser. A 100, 411–421 (2004). https://doi.org/10.1007/s10107-003-0479-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10107-003-0479-2

Keywords

  • Approximation Algorithm
  • Constant Factor
  • Undirected Graph
  • Facility Location
  • Similar Technique