An O(n log n) path-based obstacle-avoiding algorithm for rectilinear Steiner tree construction

For the obstacle-avoiding rectilinear Steiner minimal tree problem, this paper presents an O(n log n)-time algorithm with theoretical optimality guarantees on a number of specific cases, which required O(n3) time in previous works. We propose a new framework to directly generate O(n) critical paths...

Full description

Saved in:
Bibliographic Details
Published in2009 46th ACM/IEEE Design Automation Conference pp. 314 - 319
Main Authors Liu, Chih-Hung, Yuan, Shih-Yi, Kuo, Sy-Yen, Chou, Yao-Hsin
Format Conference Proceeding
LanguageEnglish
Published New York, NY, USA ACM 26.07.2009
IEEE
SeriesACM Conferences
Subjects
Algorithm design and analysis
Geometry
Hardware > Electronic design automation > Physical design (EDA)
Physical design
Pins
Routing
Spanning tree
Steiner tree
Steiner trees
Tree graphs
routing
physical design
Steiner tree
spanning tree
Online AccessGet full text

Cover

More Information
Summary:For the obstacle-avoiding rectilinear Steiner minimal tree problem, this paper presents an O(n log n)-time algorithm with theoretical optimality guarantees on a number of specific cases, which required O(n3) time in previous works. We propose a new framework to directly generate O(n) critical paths as essential solution components, and prove that those paths guarantee the existence of desirable solutions. The path-based framework neither generates invalid initial solutions nor constructs connected routing graphs, and thus provides a new way to deal with the OARSMT problem. Experimental results show that our algorithm achieves the best speed performance, while the average wirelength of the resulting solutions is only 1.1% longer than that of the best existing solutions.
ISBN:9781605584973
1605584975
ISSN:0738-100X
DOI:10.1145/1629911.1629998