The 1-steiner tree problem
- 31 March 1987
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 8 (1), 122-130
- https://doi.org/10.1016/0196-6774(87)90032-0
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- The Euclidean travelling salesman problem is NP-completeTheoretical Computer Science, 1977
- Steiner Minimal TreesSIAM Journal on Applied Mathematics, 1968
- On the Steiner ProblemCanadian Mathematical Bulletin, 1967