Title :
Constructing the optimal rectilinear Steiner tree derivable from a minimum spanning tree
Author :
Jan-Ming Ho ; Vijayan, G. ; Wong, C.K.
Author_Institution :
Acad. Sinica, Taipei, Taiwan
Abstract :
A polynomial time algorithm is given for constructing the minimum cost rectilinear Steiner tree (RST) that is derivable from a minimum spanning tree (MST) of a given point set, such that the MST edges have staircase layouts in the RST. RSTs produced by the algorithm have a property called stability, which enables the rerouting of any subset of the RST edges, while maintaining the cost of the RST, and not causing overlaps with each other or with the other RST edges.<>
Keywords :
circuit layout CAD; computational complexity; trees (mathematics); edges; minimum cost rectilinear Steiner tree; minimum spanning tree; optimal rectilinear Steiner tree; point set; polynomial time algorithm; rerouting; stability; staircase layouts; subset; Cost function; Heuristic algorithms; Polynomials; Stability; Very large scale integration; Wire;
Conference_Titel :
Computer-Aided Design, 1989. ICCAD-89. Digest of Technical Papers., 1989 IEEE International Conference on
Conference_Location :
Santa Clara, CA, USA
Print_ISBN :
0-8186-1986-4
DOI :
10.1109/ICCAD.1989.76893
