Improved approximations for the steiner tree problem

Journal of Algorithms

Volumn 17, Issue 3, 1994, Pages 381-408

  Berman, Piotr ^a   Ramaiyer, Vishwanathan ^b  

^a PENNSYLVANIA STATE UNIVERSITY   (United States)

^b Tandem Corporation ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000785722     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1994.1041     Document Type: Article

References (21)

1. P. Berman and V. Ramaiyer, "An Approximation Algorithm for the Steiner Tree Problem," Technical Report CS-91-05, The Pennsylvania State University, 1991.
2. M. Bern and P. Plassmann, The Steiner problems with edge lengths 1 and 2, Inform. Process. Lett. 32 (1989), 171-176.
3. T. H. Brylawski, Some properties of basic families of subsets, Discrete Math. 6 (1973), 333-341.
4. D. Z. Du, Y. Zhang, and O. Feng, On better heuristic for euclidean Steiner minimum trees in "Proceedings, 32nd FOCS, 1991," pp. 431-439.
5. D. Z. Du and F. K. Hwang, An approach for proving lower bounds: Solution of Gilbert-Pollak's conjecture on Steiner ratio, in "Proceedings, 31st FOCS," 1990, pp. 76-85.
6. G. N. Frederickson, Data structures for on-line updating of minimum spanning trees, with applications, SIAM J. Comput. 14 (1985), 781-798.
7. M. R. Garey, R. L. Graham, and D. S. Johnson, The complexity of computing Steiner minimal trees, SIAM J. Appl. Math. 32 (1977), 835-859.
8. M. R. Garey and D. S. Johnson, The rectilinear Steiner problem is NP-complete, SIAM J. Appl. Math 32 (1977), 826-834.
9. E. N. Gilbert and H. O. Pollack, Steiner minimal trees, SIAM J. Appl. Math 16 (1968), 1-29.
10. C. Greene, A multiple exchange property for bases, Proc. Amer. Math. Soc. 39 (1973), 45-50.
11. S. L. Hakimi, Steiner's problem in graphs and its implications Networks 1 (1971), 113-133.
12. M. Hanan, On Steiner's problem with rectilinear distance, SIAM J. Appl. Math. 14 (1966), 255-265.
13. F. K. Hwang, On Steiner minimal trees with rectilinear distance, SIAM J. Appl. Math 30 (1976), 104-114.
14. R. M. Karp, Reducibility among combinatorial problems, "Complexity of Computer Computations," in (Miller and Thatcher, Eds), pp. 85-103, Plenum Press, New York, 1972.
15. L. Kou, G. Markowsky, and L. Berman, A fast algorithm for Steiner trees, Acta Informal. 15 (1981), 141-145.
16. A. J. Levin, Algorithm for the shortest connection of a group of vertices, Soviet Math. Dokl. 12 (1971) 1477-1481.
17. D. D. Sleator and R.E. Tarjan, A data structure for dynamic trees, J. Comput. System. Sci. 4 (1975), 362-391.
18. H. Takahashi and A. Matsuyama, An approximate solution for the Steiner problem in graphs, Math. Japon. 24 (1980), 573-577.
19. A. Z. Zelikovsky, The 11/6 approximation algorithm for the Steiner problem on networks, submitted for publication.
20. A. Z. Zelikovsky, The 11/8 approximation algorithm for the Steiner problem on networks with rectilinear distance, manuscript.
21. A. Z. Zelikovsky, personal communication.