The 1-steiner tree problem
Authors:
- George GeorgakopoulosGGGeorge Georgakopoulos
- Christos H PapadimitriouCPChristos H Papadimitriou
- 1 March 1987
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 8 (1) , 122-130
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