An O(n log n) heuristic for steiner minimal tree problems on the euclidean metric
- 1 March 1981
- Vol. 11 (1), 23-39
- https://doi.org/10.1002/net.3230110104
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- An O(n log n) algorithm for suboptimal rectilinear Steiner treesIEEE Transactions on Circuits and Systems, 1979
- A Lower Bound for the Steiner Tree ProblemSIAM Journal on Applied Mathematics, 1978
- Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the PlaneMathematics of Operations Research, 1977
- The Complexity of Computing Steiner Minimal TreesSIAM Journal on Applied Mathematics, 1977
- Finding Minimum Spanning TreesSIAM Journal on Computing, 1976
- A note on Fermat's problemMathematical Programming, 1973
- The Generation of Minimal Trees with a Steiner TopologyJournal of the ACM, 1972
- Steiner Minimal TreesSIAM Journal on Applied Mathematics, 1968
- On the Problem of SteinerCanadian Mathematical Bulletin, 1961
- Link-Length Minimization in NetworksOperations Research, 1958