Closing the gap: near-optimal Steiner trees in polynomial time
- 1 January 1994
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 13 (11) , 1351-1365
- https://doi.org/10.1109/43.329264
Abstract
No abstract availableThis publication has 34 references indexed in Scilit:
- A new global router for row-based layoutPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Local improvement in Steiner treesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- An exact rectilinear Steiner tree algorithmPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- On Optimal Interconnections for VLSIPublished by Springer Nature ,1995
- Rectilinear Steiner tree construction by local and global refinementIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1994
- On the maximum degree of minimum spanning treesPublished by Association for Computing Machinery (ACM) ,1994
- Transitions in geometric minimum spanning treesDiscrete & Computational Geometry, 1992
- Unsolved Problems in GeometryPublished by Springer Nature ,1991
- On two geometric problems related to the travelling salesman problemJournal of Algorithms, 1984
- Use of Steiner's problem in suboptimal routing in rectilinear metricIEEE Transactions on Circuits and Systems, 1976