An Improved Algorithm for Steiner Trees
- 1 February 1990
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Applied Mathematics
- Vol. 50 (1) , 244-263
- https://doi.org/10.1137/0150015
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Exact computation of Steiner minimal trees in the planeInformation Processing Letters, 1986
- A linear time algorithm for full steiner treesOperations Research Letters, 1986
- An algorithm for the steiner problem in the euclidean planeNetworks, 1985
- The Complexity of Computing Steiner Minimal TreesSIAM Journal on Applied Mathematics, 1977
- The Generation of Minimal Trees with a Steiner TopologyJournal of the ACM, 1972
- Properties of a multifacility location problem involving euclidian distancesNaval Research Logistics Quarterly, 1972
- On the Efficiency of the Algorithm for Steiner Minimal TreesSIAM Journal on Applied Mathematics, 1970
- Steiner Minimal TreesSIAM Journal on Applied Mathematics, 1968
- Minimum cost communication networksBell System Technical Journal, 1967
- On the Problem of SteinerCanadian Mathematical Bulletin, 1961