Global routing based on Steiner min-max trees
Authors:
- C. ChiangCCC. Chiang
- M. SarrafzadehMSM. Sarrafzadeh
- C.K. WongCWC.K. Wong
- 1 January 1990
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 9 (12) , 1318-1325
Abstract
No abstract availableThis publication has 19 references indexed in Scilit:
- An optimal Steiner tree algorithm for a net whose terminals lie on the perimeter of a rectangleIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1990
- New algorithms for the rectilinear Steiner tree problemIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1990
- Global wire routing in two-dimensional arraysAlgorithmica, 1987
- A Hierarchical Global Wiring Algorithm for Custom Chip DesignIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1987
- An iterative-improvement penalty-function-driven wire routing systemIBM Journal of Research and Development, 1984
- Planar Formulae and Their UsesSIAM Journal on Computing, 1982
- Use of Steiner's problem in suboptimal routing in rectilinear metricIEEE Transactions on Circuits and Systems, 1976
- On Steiner Minimal Trees with Rectilinear DistanceSIAM Journal on Applied Mathematics, 1976
- An Algorithm for Path Connections and Its ApplicationsIEEE Transactions on Electronic Computers, 1961
- On the Shortest Spanning Subtree of a Graph and the Traveling Salesman ProblemProceedings of the American Mathematical Society, 1956