New Algorithms for the Rectilinear Steiner Tree Problem

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Volumn 9, Issue 2, 1990, Pages 185-193

  Ho, Jan Ming ^a   Vijayan, Gopalakrishnan ^b   Wong, C K ^b  

^a INSTITUTE OF INFORMATION SCIENCE   (Taiwan)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED DESIGN; MATHEMATICAL TECHNIQUES--TREES;

MINIMUM SPANNING TREE; RECTILINEAR STEINER TREE PROBLEM; VLSI GLOBAL ROUTING;

INTEGRATED CIRCUITS, VLSI;

EID: 0025384580     PISSN: 02780070     EISSN: 19374151     Source Type: Journal    
DOI: 10.1109/43.46785     Document Type: Article

References (12)

1. A. V. Aho, M. R. Garey, and F. K. Hwang, “Rectilinear Steiner trees: Efficient special-case algorithm,” Networks, vol. 7, pp. 37–58, 1977.
2. A. V. Aho, J. E. Hopcroft, and J. D. Ullman, Data Structures and Algorithms. Reading, MA: Addison-Wesley, 1983.
3. J. P. Cohoon, D. S. Richards, and J. S. Salowe, “A linear-time Steiner tree routing algorithm for terminals on the boundary of a rectangle,” in Dig. Technical Papers, ICCAD-88, pp. 402–405, Nov. 1988.
4. M. R. Garey and D. S. Johnson, “The rectilinear Steiner tree problem in JVP-complete,” SIAMJ. Appl. Math., vol. 32, no. 4, pp. 826–834, 1977.
5. M. Hanan, “On Steiner’s problem with rectilinear distance,” SIAM J. Appl. Math., vol. 14, no. 2, pp. 255–265, 1966.
6. J-M. Ho, G. Vijayan, and C. K. Wong, “A new approach to the rectilinear Steiner tree problem,” in Proc. 26th ACM/IEEE Design Automation Conf., pp. 161–166, June 1989.
7. F. K. Hwang, “On Steiner minimal trees with rectilinear distance,” SIAM J. Appl. Math., vol. 30, no. 1, pp. 104–114, 1976.
8. F. K. Hwang, “An O(n log n) algorithm for suboptimal rectilinear Steiner trees,” IEEE Trans. Circuits Syst., vol. CAS-26, pp. 75–77, Jan. 1979.
9. D. T. Lee and C. K. Wong, “Voronoi diagrams in L1 (L∞) metrics with 2-dimensional storage applications,” SIAM J. Computing, vol. 9, no. 1, pp. 200–211, Feb. 1980.
10. J. H. Lee, N. K. Bose, and F. K. Hwang, “Use of Steiner’s problem in suboptimal routing in rectilinear metric,” IEEE Trans. Circuits Syst., vol. CAS-23, pp. 470–476, July 1976.
11. K-W. Lee and C. Sechen, “A new global router for row-based layout,” in Dig. Tech. Papers, ICCAD-88, pp. 180–183, Nov. 1988.
12. J. G. Xiong, “Algorithms for global routing,” in Proc. 23rd ACM/ IEEE Design Automation Conf., pp. 824–830, June 1986.