NP-completeness of the hamming salesman problem
- 1 March 1985
- journal article
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 25 (1) , 289-292
- https://doi.org/10.1007/bf01935007
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- Compact storage schemes for formatted files by spanning treesBIT Numerical Mathematics, 1979
- The Euclidean travelling salesman problem is NP-completeTheoretical Computer Science, 1977
- Some NP-complete geometric problemsPublished by Association for Computing Machinery (ACM) ,1976