The Complexity of Computing Steiner Minimal Trees
- 1 June 1977
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Applied Mathematics
- Vol. 32 (4), 835-859
- https://doi.org/10.1137/0132072
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- The Rectilinear Steiner Tree Problem is $NP$-CompleteSIAM Journal on Applied Mathematics, 1977
- Rectilinear steiner trees: Efficient special-case algorithmsNetworks, 1977
- On Steiner Minimal Trees with Rectilinear DistanceSIAM Journal on Applied Mathematics, 1976
- Closest-point problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1975
- On the Computational Complexity of Combinatorial ProblemsNetworks, 1975
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972
- Steiner Minimal TreesSIAM Journal on Applied Mathematics, 1968
- Minimum cost communication networksBell System Technical Journal, 1967
- On Steiner’s Problem with Rectilinear DistanceSIAM Journal on Applied Mathematics, 1966
- On the Problem of SteinerCanadian Mathematical Bulletin, 1961