Title :
Fast vicinity-upgrade algorithm for rectilinear Steiner trees
Author :
Chua, J.K. ; Lim, Yang Choon
Author_Institution :
Dept. of Electr. Eng., Nat. Univ. of Singapore, Singapore
fDate :
6/20/1991 12:00:00 AM
Abstract :
A new algorithm for rectilinear Steiner trees (RST) is presented. The proposed algorithm is based on successively constructing a vicinity structure from a rectilinear minimum spanning tree (MST) and generating a refined RST. The algorithm achieves an 8.5-10% average cost improvement over the rectilinear MST at a time complexity of O(n log n). To address specifically the linear programming approach of global routing the algorithm is modified to generate K trees.
Keywords :
VLSI; circuit layout CAD; computational complexity; linear programming; network topology; trees (mathematics); C language implementation; CAD; VLSI design; fast vicinity upgrade algorithm; global routing; linear programming; rectilinear Steiner trees; rectilinear minimum spanning tree; time complexity;
Journal_Title :
Electronics Letters
DOI :
10.1049/el:19910710
