Faster approximation algorithms for the rectilinear steiner tree problem

Discrete and Computational Geometry

Volumn 18, Issue 1, 1997, Pages 93-109

  Foßmeier U ^a   Kaufmann, M ^a   Zelikovsky, A ^b  

^a UNIVERSITY OF TÜBINGEN   (Germany)

^b University of Virginia   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0040007807     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00009310     Document Type: Article

References (20)

1. P. Berman, V. Ramaiyer, Improved approximations for the Steiner tree problem. Proceedings, 3rd ACMSIAM Symposium on Discrete Algorithms, pp. 325-334, 1992.
2. M.W. Bern, R.L. Graham, The shortest-network problem. Sci. Amer., 1, 66-71, 1989.
3. Ding-Zhu Du, Yanjun Zhang, Qing Feng, On better heuristic for Euclidean Steiner minimum trees. Proceedings, 32nd Foundations of Computer Science, pp. 431-439 1991.
4. D. Eppstein, G.F. Italiano et al., Maintenance of a minimum spanning forest in a dynamic planar graph. Proceedings, 1st ACM-SIAM Symposium on Discrete Algorithms, pp. 1-11, 1990.
5. G. Frederickson, Data structures for on-line updating of minimum spanning trees, with applications. SIAM J. Comput., 14, 781-789, 1985.
6. M.R. Garey, D.S. Johnson, The rectilinear Steiner problem is NP-complete. SIAM J. Appl. Math., 32, 826-834, 1977.
7. E.N. Gilbert, H.O. Pollak, Steiner minimal trees. SIAM J. Appl. Math., 16, 1-29, 1968.
8. M. Hanan, On Steiner's problem with rectilinear distance. SIAM J. Appl. Math., 14, 255-265, 1966.
9. F.K. Hwang, On Steiner minimal trees with rectilinear distance. SIAM J. Appl. Math., 30, 104-114, 1976.
10. R.M. Karp, Reducibility among combinatorial problems. In Miller and Thatcher (eds.). Complexity of Computer Computations, Plenum, New York, pp. 85-103, 1972.
11. B. Korte, H.J. Prömel, A. Steger, Steiner trees in VLSI-layout. In B. Korte et al. (eds.). Paths, Flows VLSI-Layout, Springer-Verlag, Berlin, pp. 185-214, 1990.
12. Th. Lengauer, Combinatorial Algorithms for Integrated Circuit Layout. Wiley, New York, 1990.
13. K. Mehlhorn, Data Structures and Algorithms III: Multidimensional Data Structures and Computational Geometry. Springer-Verlag, Berlin, 1985.
14. D. Richards, Fast heuristic algorithms for rectilinear Steiner trees. Algorithmica, 4, 191-207, 1989.
15. H. Takahashi, A. Matsuyama, An approximate solution for the Steiner problem in graphs. Math. Japon., 24,573-577, 1980.
16. D.E. Willard, G.S. Lueker, Adding range restriction capability to dynamic data structures. J. Assoc. Comput. Mach., 32, 597-617, 1985.
17. Y.F. Wu, P. Widmayer, C.K. Wong, A faster approximation algorithm for the Steiner problem in graphs. Acta Inform., 23, 223-229, 1986.
18. A.C. Yao, On constructing minimum spanning trees in k-dimensional space and related problems. SIAM J. Comput., 11, 721-736, 1982.
19. A.Z. Zelikovsky, The 1 1/8-approximation algorithm for the Steiner problem on Networks with rectilin-ear distance. In Sets, Graphs and Numbers, Colloq. Math. Soc. Janos Bolyai, Vol. 60, North-Holland, Amsterdam, pp. 733-745, 1992.
20. A.Z. Zelikovsky, An 11/6-approximation algorithm for the Steiner problem on graphs. Algorithmica, 9, 463-470. 1993.