On two geometric problems related to the travelling salesman problem
- 30 June 1984
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 5 (2) , 231-246
- https://doi.org/10.1016/0196-6774(84)90029-4
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- Hamilton Paths in Grid GraphsSIAM Journal on Computing, 1982
- The np-completeness of the hamiltonian cycle problem in planar diagraphs with degree bound twoInformation Processing Letters, 1979
- The Euclidean travelling salesman problem is NP-completeTheoretical Computer Science, 1977