NP-completeness of the Hamming salesman problem (Q761246): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 11:26, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | NP-completeness of the Hamming salesman problem |
scientific article |
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
