On the approximability of the Steiner tree problem

Theoretical Computer Science

Volumn 295, Issue 1-3, 2003, Pages 387-402

  Thimm, Martin ^a  

^a HUMBOLDT UNIVERSITY   (Germany)

Author keywords

Approximability; Gadget reduction; Lower bounds; Minimum Steiner tree

Indexed keywords

APPROXIMATION THEORY; LINEAR EQUATIONS; PROBLEM SOLVING; SET THEORY;

STEINER TREE PROBLEM;

TREES (MATHEMATICS);

EID: 0037463533     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(02)00414-0     Document Type: Conference Paper

References (19)

1. S. Arora, Polynomial time approximation schemes for the Euclidian TSP and other geometric problems, Proc. 37th Annu. Symp. on Foundations of Computer Science, 1996, pp. 2-11.
2. S. Arora, C. Lund, R. Motwani, M. Sudan, M. Szegedy, Proof verification an hardness of approximation problems, Proc. 33rd Annu. Symp. on Foundations of Computer Science, 1992, pp. 14-23.
3. P. Berman, M. Karpinski, On some tighter inapproximability results, further improvements, electronic colloquium on computational complexity, Report No. 65, 1998.
4. Berman P., Ramaiyer V. Improved approximations for the Steiner tree problem. J. Algorithms. 17:1994;381-408.
5. Bern M., Plassmann P. The Steiner Problem with edge lengths 1 and 2. Inform. Process. Lett. 32:1989;171-176.
6. Gabber O., Galil Z. Explicit construction of linear-sized superconcentrators. J. Comput. System Sci. 22:1981;407-420.
7. C. Gröpl, S. Hougardy, T. Nierhoff, H.J. Prömel, Approximation algorithms for the Steiner tree problem in graphs, Technical Report, Humboldt Universität zu Berlin, 2000.
8. J. Hå stad, Some optimal inapproximability results, Proc. 28th Annu. Symp, on Theory of Computing, ACM, 1997.
9. S. Hougardy, H.J. Prömel, A 1.598 approximation algorithm for the Steiner Problem in graphs, in: Proc. Tenth Annu. ACM-SIAM Symp. on Discrete Algorithms 1999, pp. 448-453.
10. Hwang F.K., Richards D.S., Winter P. The Steiner Tree Problem. 1992;Elsevier, Amsterdam.
11. Karpinski M., Zelikovsky A. New approximation algorithms for the Steiner tree problems. J. Combin. Optim. 1:1997;47-65.
12. Lengauer T. Combinatorial Algorithms for Integrated Circuit Layout. 1990;Wiley, Chichester, England.
13. Lubotzky A., Philips P., Sarnak P. Ramanujan graphs. Combin. 8:1988;261-277.
14. Margulis G.A. Explicit construction of concentrators. Problemy Inform. Trans. 9:1973;325-332.
15. C.H. Papadimitriou, S. Vempala, On the approximability of the traveling salesman problem, Proc. 32nd ACM Symp. on the Theory of Computing, Portland, 2000.
16. Prömel H.J., Steger A. A new approximation algorithm for the Steiner tree problem with performance ratio 5/3. J. Algorithms. 36:2000;89-101.
17. G. Robins, A. Zelikovsky, Improved Steiner tree approximation in graphs, in: Proc. 11th Annu. ACM-SIAM Symp. on Discrete Algorithms, 2000, pp. 770-779.
18. Sarnak P. Some Applications of Modular Forms. Cambridge Tracts in Mathematics. Vol. 99:Cambridge;Cambridge University Press.
19. Zelikovsky A. An 11/6-approximation algorithm for the network Steiner problem. Algorithmica. 9:1993;463-470.