Sciweavers

ORL
2008
86views more  ORL 2008»
13 years 10 months ago
Searching the k-change neighborhood for TSP is W[1]-hard
We show that searching the k-change neighborhood is W[1]-hard for metric TSP, which means that finding the best tour in the k-change neighborhood essentially requires complete sea...
Dániel Marx