Computing optimal rectilinear steiner trees: A survey and experimental evaluation

Discrete Applied Mathematics

Volumn 90, Issue 1-3, 1999, Pages 161-171

  Ganley, Joseph L ^a  

^a CADENCE DESIGN SYSTEMS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0038588238     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(98)00089-4     Document Type: Article

References (28)

1. J.E. Beasley, An SST-based algorithm for the Steiner problem in graphs, Networks 19 (1989) 1-16.
2. J.L. Bentley, H.T. Kung, M. Schkolnick, C.D. Thompson, On the average number of maxima in a set of vectors and applications, J. ACM, 25 (1978) 536-543.
3. M. Bern, Faster exact algorithms for Steiner trees in planar networks, Networks 20 (1990) 109-120.
4. L.L. Deneen, J.B. Dezell, Using partitioning and clustering techniques to generate rectilinear Steiner trees, in: Proc. 2nd Canadian Conference on Computational Geometry, (1990) pp. 315-318.
5. L.L. Deneen, G.M. Shute, C.D. Thomborson, A probably fast, provably optimal algorithm for rectilinear Steiner trees, Random Structures and Algorithms 5 (1994) 535-557.
6. S.E. Dreyfus, R.A. Wagner, The Steiner problem in graphs, Networks 1 (1972) 195-207.
7. J.L. Ganley, Geometric interconnection and placement algorithms, PhD thesis, Department of Computer Science, University of Virginia, Charlottesville, Virginia, 1995.
8. J.L. Ganley, J.P. Cohoon, A faster dynamic programming algorithm for exact rectilinear Steiner minimal trees, in: Proc. 4th Great Lakes Symposium on VLSI (1994) pp. 238-241..
9. n) time, in: Proc. 6th Canadian Conference on Computational Geometry (1994) pp. 308-313.
10. J.L. Ganley, J.P. Cohoon, Improved computation of optimal rectilinear steiner minimal trees, Int. J. Comput. Geometry Appl. 7 (1997) 457-472.
11. M.R. Garey, D.S. Johnson, The rectilinear Steiner tree problem is NP-complete, SIAM J. Appl. Math. 32 (1977) 826-834.
12. S.L. Hakimi, Steiner's problem in graphs and its implications, Networks 1 (1971) 113-133.
13. M. Hanan, On Steiner's problem with rectilinear distance, SIAM J. Appl. Math. 14 (1996) 255-265.
14. F.K. Hwang, On Steiner minimal trees with rectilinear distance, SIAM J. Appl. Math. 30 (1976) 104-114.
15. F.K. Hwang, D.S. Richards, P. Winter, The Steiner Tree Problem, Vol. 53, Annals of Discrete Mathematics, North-Holland, Amsterdam, Netherlands, 1992.
16. D.M. Inada, private communication, (1995).
17. J. Komlós, M.T. Shing, Probabilistic partitioning algorithms for the rectilinear Steiner problem, Networks 15 (1985) 413-423.
18. F.D. Lewis, W.C. Pong, N. Van Cleave, Optimum Steiner tree generation, in: Proc. 2nd Great Lakes Symposium on VLSI (1992) pp. 207-212.
19. J.S. Provan, Convexity and the Steiner tree problem, Networks 18 (1988) 55-72.
20. G. Robins, private communication, 1995.
21. J.S. Salowe, D.M. Warme, 35-point rectilinear Steiner minimal trees in a day, Networks 25 (1995) 69-87.
22. M.L. Shore, L.R. Foulds, P.B. Gibbons, An algorithm for the Steiner problem in graphs, Networks 12 (1982) 323-333.
23. A.F. Sidorenko, On minimal rectilinear Steiner trees, Diskretnaya Matematika, 1 (1989) 28-37 (in Russian).
24. C.D. Thomborson, B. Alpern, L. Carter, Rectilinear Steiner tree minimization on a workstation, In N. Dean, G. E. Shannon (eds.) Computational Support for Discrete Mathematics, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 15, American Mathematical Society, Providence, RI, 1994 pp. 119-136.
25. ̃warme/.
26. P. Winter, Reductions for the rectilinear Steiner tree problem, Networks 26 (1995) 187-198.
27. Y.T. Wong, M. Pecht, A solution for Steiner's problem, in M. Pecht (ed), Placement and Routing of Electronic Modules, Marcel Dekker, New York, NY (1993) pp. 261-304..
28. Y.Y. Yang, O. Wing, Optimal and suboptimal solution algorithms for the wiring problem, in: Proc. Int. Symp. on Circuit Theory (1972) pp. 154-158.