On approximation algorithms for the terminal Steiner tree problem

Information Processing Letters

Volumn 89, Issue 1, 2004, Pages 15-18

  Drake, Doratha E ^a   Hougardy, Stefan ^a  

^a HUMBOLDT UNIVERSITY   (Germany)

Author keywords

Approximation algorithms; Steiner tree

Indexed keywords

ALGORITHMS; GRAPH THEORY; POLYNOMIAL APPROXIMATION; TREES (MATHEMATICS);

STEINER TREES;

PROBLEM SOLVING;

EID: 0344898287     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2003.09.014     Document Type: Article

References (10)

1. Arora S., Lund C., Motwani R., Sudan M., Szegedy M. Proof verification and hardness of approximation problems. Proc. of 33rd FOCS, Pittsburgh, PA. 1992;14-23.
2. Bern M., Plassmann P. The Steiner problem with edge lengths 1 and 2. Inform. Process. Lett. 32:1989;171-176.
3. Chen Y.H., Lu C.L., Tang C.Y. On the full and bottleneck full Steiner tree problems. Warnow T., Zhu B. Proc. 9th Annual Internat. Conf. (COCOON 2003), Big Sky, MT, USA. Lecture Notes in Comput. Sci. 2697:July 25-28, 2003;122-129 Springer, Berlin.
4. Chlebík M., Chlebíková J. Approximation hardness of the Steiner tree problem on graphs. Penttonen M., Schmidt E.M. Proceedings of 8th Scandinavian Workshop on Algorithm Theory (SWAT'02), Turku, Finland. Lecture Notes in Comput. Sci. 2368:2002;170-179 Springer Verlag, Berlin.
5. Feige U. A threshold of lnn for approximating set cover. J. ACM. 45:1998;634-652.
6. Garg N., Konjevod G., Ravi R. A polylogarithmic approximation algorithm for the group steiner tree problem. J. Algorithms. 37:2000;66-84.
7. Gröpl C., Hougardy S., Nierhoff T., Prömel H.J. Approximation algorithms for the Steiner tree problem in graphs. Cheng X., Du D.-Z. Steiner Trees in Industry. 2001;235-279 Kluwer Academic Publishers, Dordrecht.
8. Hwang F.K., Richards D.S., Winter P. The Steiner Tree Problem. 1992;North-Holland, New York.
9. Lin G.-H., Xue G. On the terminal Steiner tree problem. Inform. Process. Lett. 84:2002;103-107.
10. Robins G., Zelikovsky A. Improved Steiner tree approximation in graphs. Proc. 11th Annual ACM-SIAM Symp. on Discrete Algorithms, San Francisco, CA. 2000;770-779.