The parameterized complexity of local search for TSP, more refined (Q378245)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 6225279
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The parameterized complexity of local search for TSP, more refined |
scientific article; zbMATH DE number 6225279 |
Statements
The parameterized complexity of local search for TSP, more refined (English)
0 references
11 November 2013
0 references
NP-hard problem
0 references
heuristics
0 references
problem kernel
0 references
fixed-parameter tractability
0 references
W[1]-hardness
0 references
lower bounds based on ETH
0 references
0 references
0 references
0 references
0.9897257089614868
0 references
0.7881581783294678
0 references
0.7410895824432373
0 references
0.7309388518333435
0 references
0.7309385538101196
0 references
