An efficient hierarchical timing-driven Steiner tree algorithm for global routing
Authors:
- 1 August 2003
- journal article
- Published by Elsevier in Integration
- Vol. 35 (2) , 69-84
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Buffered Steiner trees for difficult instances2001
- Algorithms for non-Hanan-based optimization for VLSI interconnect under a higher-order AWE modelIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2000
- An efficient and optimal algorithm for simultaneous buffer and wire sizingIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1999
- Optimal wiresizing for interconnects with multiple sourcesACM Transactions on Design Automation of Electronic Systems, 1996
- Optimal wiresizing under Elmore delay modelIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1995
- Minimal delay interconnect design using alphabetic trees1994
- Performance-driven Steiner tree algorithm for global routing1993
- Hierarchical Steiner tree construction in uniform orientationsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1992
- The steiner problem in graphsNetworks, 1971
- The Transient Response of Damped Linear Networks with Particular Regard to Wideband AmplifiersJournal of Applied Physics, 1948