NP-completeness of the Hamming salesman problem (Q761246): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3339301 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Compact storage schemes for formatted files by spanning trees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4155835 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Euclidean traveling salesman problem is NP-complete / rank | |||
Normal rank | |||
Latest revision as of 16:46, 14 June 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
