Skip to main content
SpringerLink
Log in

The Steiner tree problem and its generalizations

  • Conference paper
  • First Online:
Approximation Algorithms for Combinatiorial Optimization (APPROX 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1444))

Abstract

We will survey recent approximation algorithms for the metric Steiner tree problem and its generalization, the Steiner network problem. We will also discuss the bidirected cut relaxation for the metric Steiner tree problem.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Agrawal, P. Klein, and R. Ravi. When trees collide: An approximation algorithm for the generalized Steiner problem on networks. SIAM Journal on Computing, 24(3):440–456, June 1995.

    Article  MATH  MathSciNet  Google Scholar 

  2. S. Arora. Nearly linear time approximation schemes for Euclidean TSP and other geometric problems. In 38th Annual Symposium on Foundations of Computer Science, pages 554–563, Miami Beach, Florida, 20–22 October 1997. IEEE.

    Google Scholar 

  3. P. Berman and V. Ramaiyer. Improved approximations for the Steiner tree problem. J. Algorithms, 17, 381–408, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  4. P. Camerini, G. Galbiati, and F. Maffioli. Random pseudo-polynomial algorithms for exact matroid problems. J. Algorithms 13, 258–273, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  5. D. Du and F. Hwang. A proof of Gilbert-Pollack's conjecture on the Steiner ratio. Algorithmica 7, 121–135, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  6. J. Edmonds. Optimum branchings. J. Res. Nat. Bur. Standards, B71:233–240, 1967.

    MathSciNet  Google Scholar 

  7. N. Garg, V. V. Vazirani, and M. Yannakakis. Approximation algorithms for multiway cuts in node-weighted and directed graphs. Proc. 21th International Colloquium on Automata, Languages and Programming, 1994.

    Google Scholar 

  8. M. Goemans. Personal communication, 1996.

    Google Scholar 

  9. M.X. Goemans and D.P. Williamson. A genera) approximation technique for constrained forest problems. SIAM Journal on Computing, 24(2):296–317, April 1995.

    Article  MATH  MathSciNet  Google Scholar 

  10. M.X. Goemans, A. Goldberg, S. Plotkin, D. Shmoys, E. Tados, and D.P. Williamson. Approximation algorithms for network design problems. SODA, 223–232, 1994.

    Google Scholar 

  11. M. Grötschel, L. Lovász, and A. Schrijver. The ellipsoid method and its consequences in combinatorial optimization. Combinatorica, 1(2):169–197, 1981.

    MATH  MathSciNet  Google Scholar 

  12. K. Jain. A factor 2 approximation algorithm for the generalized steincr network problem, manuscript, 1998.

    Google Scholar 

  13. L. Kou, G. Markowsky, and L. Berman. A fast algorithm for Steiner trees. Acta Informatica 15, 141–145, 1981.

    Article  MATH  MathSciNet  Google Scholar 

  14. M. Karpinski and A. Zelikovsky. New approximation algorithms for the Steiner tree problem. Electr. Colloq. Comput. Compl., TR95-030, 1995.

    Google Scholar 

  15. L. Lovasz. The matroid matching problem. Algebraic Methods in Graph Theory, Colloquia Mathematica Societatis Janos Bolyai, Szeged (Hungary), 1978.

    Google Scholar 

  16. H. Narayanan, H. Saran, and V.V. Vazirani. Randomized parallel algorithms for matroid union and intersection, with applications to arboresences and edge-disjoint spanning trees. SIAM. J. Comput., vol. 23, No. 2, 387–397, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  17. G. L. Nemhauser and L. E. Irotter, Jr.. Vertex packing: structural properties and algorithms. Mathematical Programming, 8:232–248, 1975.

    Article  MATH  MathSciNet  Google Scholar 

  18. H. J. Prömel and A. Steger. RNC-approximation algorithms for the Steincr problem. In R. Reischuk and M. Morvan, editors, Proceedings of the Symposium on Theoretical Aspects of Computer Science, volume 1200 of Lecture Notes in Computer Science, pages 559–570. Springer-Verlag, Berlin, Germany, 1997

    Google Scholar 

  19. S. Rajagopalan and V.V. Vazirani. On the Bidirected Cut Relaxation for the Metric Steincr Tree Problem. Submitted, 1998.

    Google Scholar 

  20. D. Williamson, M. Goeumns, M. M il mil, and V. Vnzirani. A primal-dual approximation algorithm for generalized steiner network problems. Combinatorica, 15, 1995.

    Google Scholar 

  21. A. Zelikovsky. An 11/6-approximation algorithm for the network Steiner problem. Algorithmiert, 9:463–470, 1993.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. College of Computing, Georgia Institute of Technology, USA

    Vijay V. Vazirani

Authors
  1. Vijay V. Vazirani
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Klaus Jansen José Rolim

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Vazirani, V.V. (1998). The Steiner tree problem and its generalizations. In: Jansen, K., Rolim, J. (eds) Approximation Algorithms for Combinatiorial Optimization. APPROX 1998. Lecture Notes in Computer Science, vol 1444. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0053961

Download citation

  • DOI: https://doi.org/10.1007/BFb0053961

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64736-2

  • Online ISBN: 978-3-540-69067-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation