Critical net routing
- 10 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 174-177
- https://doi.org/10.1109/iccd.1991.139875
Abstract
A critical net has been routed traditionally by interconnecting its terminals with a minimum length rectilinear Steiner tree (MRST). A novel interconnection form, the maximum performance tree (MPT), that better approximates an interconnection with optimal circuit performance is proposed. In addition, a heuristic approach is presented that quickly generates MPTs, and the quality of these trees is compared with MRSTs for several net instances Author(s) Cohoon, J.P. Dept. of Comput. Sci., Virginia Univ., Charlottesville, VA, USA Randall, L.J.Keywords
This publication has 5 references indexed in Scilit:
- Timing driven placementPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- New algorithms for the rectilinear Steiner tree problemIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1990
- Fast heuristic algorithms for rectilinear steiner treesAlgorithmica, 1989
- The Rectilinear Steiner Tree Problem is $NP$-CompleteSIAM Journal on Applied Mathematics, 1977
- On Steiner Minimal Trees with Rectilinear DistanceSIAM Journal on Applied Mathematics, 1976