Rectilinear Steiner tree construction by local and global refinement
- 1 March 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 (3) , 303-309
- https://doi.org/10.1109/43.265672
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- A new global router for row-based layoutPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- 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
- Fast heuristic algorithms for rectilinear steiner treesAlgorithmica, 1989
- Two probabilistic results on rectilinear steiner treesAlgorithmica, 1988
- AN 0 (N log N) HEURISTIC ALGORITHM FOR THE RECTILINEAR STEINER MINIMAL TREE PROBLEMEngineering Optimization, 1980
- Rectilinear steiner trees: Efficient special-case algorithmsNetworks, 1977
- Use of Steiner's problem in suboptimal routing in rectilinear metricIEEE Transactions on Circuits and Systems, 1976
- Suboptimal algorithm for a wire routing problemIEEE Transactions on Circuit Theory, 1972
- Shortest Connection Networks And Some GeneralizationsBell System Technical Journal, 1957