New approximation algorithms for the steiner tree problems

Journal of Combinatorial Optimization

Volumn 1, Issue 1, 1997, Pages 47-65

  Karpinski, Marek ^a,b   Zelikovsky, Alexander ^c  

^a UNIVERSITY OF BONN   (Germany)

^b INTERNATIONAL COMPUTER SCIENCE INSTITUTE   (United States)

^c University of Virginia   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0002756840     PISSN: 13826905     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1009758919736     Document Type: Article

References (23)

1. Berman, P., and V. Ramaiyer. (1991). "An approximation algorithm for the Steiner tree problem." The Pennsylvania State University, PA, Technical Report #CS-91-05.
2. Berman, P., and V. Ramaiyer. (1994). "Improved approximations for the Steiner tree problem," J. of Algorithms vol. 17 pp. 381-408.
3. Berman, P., U. Fößmeier, M. Karpinski, M. Kaufmann, and A. Zelikovsky. (1994). "Approaching the 5/4-Approximations for Rectilinear Steiner Trees," LNCS vol. 855, Springer-Verlag, pp. 60-71, 1994.
4. Bern, M., and D. Eppstein. (1995). "Approximation Algorithms for Geometric Problems," in D. Hochbaum, (ed.), Approximation Algorithms for NP-Complete Problems, PWS Publications. (to appear)
5. Bern, M., and P. Plassmann. (1989). "The Steiner problems with edge lengths 1 and 2," Inform. Process. Lett. vol. 32 pp. 171-176.
6. Borchers, A., and D. Du. (1995). "The k-Steiner Ratio in Graphs," Proc. 27th ACM STOC (1995), pp. 641-649.
7. Du, D., Y. Zhang, and Q. Feng. (1991). "On better heuristic for Euclidean Steiner minimum trees," in Proc. 32nd IEEE Symp. on Found. of Comp. Science, pp. 431-439.
8. Fößmeier, U., M. Kaufmann, and A. Zelikovsky. (1993). "Faster Approximation Algorithms for the Rectilinear Steiner Tree Problem," LNCS vol. 762, Springer-Verlag, pp. 533-542.
9. Garey, M. R., and D. S. Johnson. (1977). "The Rectilinear Steiner Problem is NP-Complete," SIAM J. Appl. Math. vol. 32 pp. 826-834.
10. Gilbert, E. N., and H. O. Pollak. (1968). "Steiner Minimal Trees" SIAM Appl. Math. vol. 16 pp. 1-29.
11. Hwang, F. K. (1976). "On Steiner Minimal Trees with Rectilinear Distance," SIAM J. Appl. Math. vol. 30 pp. 104-114.
12. Hwang, F. K. (1979). "An o(n log n) algorithm for rectilinear minimum spanning trees," J. ACM vol. 26 pp. 177-182.
13. Hwang, F. K., D. Richards, and P. Winter. (1992). The Steiner Tree Problem, Annals of Disc. Math. vol. 53.
14. Karpinski, M., and A. Zelikovsky. (1995). "1.757 and 1.267-Approximation Algorithms for the Network and Rectilinear Steiner Tree Problems." International Computer Science Institute, Berkeley, CA, Technical Report TR-95010.
15. Khang, A. B., and G. Robins, (1995). On optimal interconnections for VLSI, Kluwer Academic Publishers, Boston, MA.
16. Korte, B., H. J. Prömel, and A. Steger. (1990). "Steiner Trees in VLSI-Layouts," in Korte et al. (eds.): Paths, Flows and VLSI-Layout, Springer.
17. Mehlhorn, K. (1988). ("A faster approximation algorithm for the Steiner problem in graphs," Inf. Process. Lett. vol. 27 pp. 125-128.
18. Salowe, J. S., and D. M. Warme. (1993). "An exact rectilinear Steiner tree algorithm," in Proc. of the Int. Conf. on Comp. Design, pp. 472-475.
19. Takahashi, H., and A. Matsuyama. (1980). "An approximate solution for the Steiner problem in graphs," Math. Japonica vol. 24 pp. 573-577.
20. Zelikovsky, A. Z. (1993). "An 11/6-approximation Algorithm for the network Steiner Problem," Algorithmica vol. 9 pp. 463-470.
21. Zelikovsky, A. Z. (1992). "An 11/8-approximation Algorithm for the Steiner Problem on Networks with Rectilinear Distance," in Coll. Math. Soc. J. Bolyai vol. 60 pp. 733-745.
22. Zelikovsky, A. Z. (1993). "A faster approximation algorithm for the Steiner Tree Problem in Graphs," Inf. Process. Lett. vol. 46 pp. 79-83.
23. Zelikovsky, A. Z. (1995). "Better approximation bounds for the network and Euclidean Steiner tree problems," Manuscript.