NP-completeness of the Hamming salesman problem (Q761246)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: NP-completeness of the Hamming salesman problem |
scientific article; zbMATH DE number 3887437
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | NP-completeness of the Hamming salesman problem |
scientific article; zbMATH DE number 3887437 |
Statements
NP-completeness of the Hamming salesman problem (English)
0 references
1985
0 references
It is shown that the traveling salesman problem, where cities are bit strings with Hamming distances, is NP-complete.
0 references
Hamming salesman problem
0 references
NP-completeness
0 references
data compression
0 references
traveling salesman
0 references
bit strings with Hamming distances
0 references
0.8642417
0 references
0.8627821
0 references
0.8619164
0 references
0 references
0 references
0 references
0.83475006
0 references
0 references
0.83377856
0 references
