0000000000773149
AUTHOR
Martti Penttonen
showing 1 related works from this author
NP-completeness of the hamming salesman problem
1985
It is shown that the traveling salesman problem, where cities are bit strings with Hamming distances, is NP-complete.