New algorithms for the rectilinear Steiner tree problem

An approach to constructing the rectilinear Steiner tree (RST) of a given set of points in the plane, starting from a minimum spanning tree (MST), is discussed. The main idea in this approach is to find layouts for the edges of the MST that maximize the overlaps between the layouts, thus minimizing the cost (i.e. wire length) of the resulting rectilinear Steiner tree. Two algorithms for constructing rectilinear Steiner trees from MSTs, which are optimal under the conditions that the layout of each edge of the MST is an L shape or any staircase, respectively, are described. The first algorithm has linear time complexity and the second algorithm has a higher polynomial time complexity. Steiner trees produced by the second algorithm have a property called stability, which allows the rerouting of any segment of the tree, while maintaining the cost of the tree, and without causing overlaps with the rest of the tree. Stability is a desirable property in VLSI global routing applications. >

[1]  M. Hanan,et al.  On Steiner’s Problem with Rectilinear Distance , 1966 .

[2]  F. Hwang,et al.  An o(nlogn) algorithm for suboptimal rectilinear steiner trees , 1979 .

[3]  David S. Johnson,et al.  The Rectilinear Steiner Tree Problem is NP Complete , 1977, SIAM Journal of Applied Mathematics.

[4]  F. Hwang.  On Steiner Minimal Trees with Rectilinear Distance , 1976 .

[5]  Alfred V. Aho,et al.  Rectilinear steiner trees: Efficient special-case algorithms , 1977, Networks.

[6]  Chak-Kuen Wong,et al.  A New Approach to the Rectilinear Steiner Tree Problem , 1989, 26th ACM/IEEE Design Automation Conference.

[7]  Carl Sechen,et al.  A new global router for row-based layout , 1988, [1988] IEEE International Conference on Computer-Aided Design (ICCAD-89) Digest of Technical Papers.

[8]  Dana S. Richards,et al.  A linear-time Steiner tree routing algorithm for terminals on the boundary of a rectangle , 1988, [1988] IEEE International Conference on Computer-Aided Design (ICCAD-89) Digest of Technical Papers.

[9]  Chak-Kuen Wong,et al.  Voronoi Diagrams in L1 (Linfty) Metrics with 2-Dimensional Storage Applications , 1980, SIAM J. Comput..

[10]  J. S. Lee,et al.  Use of steiner's problem in suboptimal routing in rectilinear metric , 1976 .

[11]  J. G. Xiong.  Algorithms for Global Routing , 1986, 23rd ACM/IEEE Design Automation Conference.