Use of Steiner's problem in suboptimal routing in rectilinear metric
- 1 July 1976
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems
- Vol. 23 (7) , 470-476
- https://doi.org/10.1109/tcs.1976.1084243
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- Rectilinear steiner trees: Efficient special-case algorithmsNetworks, 1977
- On Steiner Minimal Trees with Rectilinear DistanceSIAM Journal on Applied Mathematics, 1976
- Suboptimal algorithm for a wire routing problemIEEE Transactions on Circuit Theory, 1972
- A high quality, low cost router for MOS/LSIPublished by Association for Computing Machinery (ACM) ,1972
- A Counterexample to a Theorem of Fu on Steiner's ProblemIEEE Transactions on Circuit Theory, 1972
- The steiner problem in graphsNetworks, 1971
- Computer-Aided Layout System for Integrated CircuitsIEEE Transactions on Circuit Theory, 1971
- On Steiner’s Problem with Rectilinear DistanceSIAM Journal on Applied Mathematics, 1966
- Shortest Connection Networks And Some GeneralizationsBell System Technical Journal, 1957
- On the Shortest Spanning Subtree of a Graph and the Traveling Salesman ProblemProceedings of the American Mathematical Society, 1956