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 search (modulo some complexitytheoretic assumptions).

• Type: Journal
• Year: 2008
• Where: ORL
• Authors: Dániel Marx
• Keywords: Complete Search, K-change Neighborhood, Metric Tsp, ORL 2006, ORL 2008