Searching the \(k\)-change neighborhood for TSP is W[1]-hard (Q924881)
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: Searching the \(k\)-change neighborhood for TSP is W[1]-hard |
scientific article; zbMATH DE number 5280651
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Searching the \(k\)-change neighborhood for TSP is W[1]-hard |
scientific article; zbMATH DE number 5280651 |
Statements
Searching the \(k\)-change neighborhood for TSP is W[1]-hard (English)
0 references
29 May 2008
0 references
traveling salesperson problem
0 references
W[1]-hardness
0 references
parameterized complexity
0 references
local search
0 references
