Global and detailed routing
Authors:
- Huang-Yu ChenHCHuang-Yu Chen
- Yao-Wen ChangYCYao-Wen Chang
- 1 January 2009
- book chapter
- Published by Elsevier
- p. 687-749
Abstract
No abstract availableThis publication has 42 references indexed in Scilit:
- Efficient Steiner Tree Construction Based on Spanning GraphsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2004
- MR: a new framework for multilevel full-chip routingIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2004
- A Polynomial Time-Optimal Diode Insertion/Routing Algorithm for Fixing Antenna ProblemIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2004
- Pattern routing: use and theory for increasing predictability and avoiding couplingIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2002
- Crosstalk-driven interconnect optimization by simultaneous gate and wire sizingIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2000
- Minimum crosstalk channel routingIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1996
- New algorithms for the rectilinear Steiner tree problemIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1990
- Dogleg Channel Routing is NP-CompleteIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1985
- Hierarchical Wire RoutingIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1983
- A shortest path algorithm for grid graphsNetworks, 1977