An O(n log n) algorithm for suboptimal rectilinear Steiner trees
- 1 January 1979
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems
- Vol. 26 (1) , 75-77
- https://doi.org/10.1109/tcs.1979.1084551
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- An O ( n log n ) Algorithm for Rectilinear Minimal Spanning TreesJournal of the ACM, 1979
- The Rectilinear Steiner Tree Problem is $NP$-CompleteSIAM Journal on Applied Mathematics, 1977
- 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
- Closest-point problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1975
- Suboptimal algorithm for a wire routing problemIEEE Transactions on Circuit Theory, 1972
- 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