Name
Abstract | ||
|---|---|---|
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 |
Year | DOI | Venue |
|---|---|---|
1990 | 10.1109/43.46785 | IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems |
Keywords | DocType | Volume |
VLSI,circuit layout,computational complexity,network topology,trees (mathematics),L-shape layout,VLSI global routing applications,circuit layouts,layouts,linear time complexity,minimum spanning tree,polynomial time complexity,rectilinear Steiner tree problem,stability,staircase layout | Journal | 9 |
Issue | ISSN | Citations |
2 | 0278-0070 | 30 |
PageRank | References | Authors |
4.77 | 2 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| J. -M. Ho | 1 | 30 | 4.77 |
| G. Vijayan | 2 | 181 | 25.99 |
| C. K. Wong | 3 | 1459 | 513.44 |