Searching the k-change neighborhood for TSP is W[1]-hard
Author:
- 31 January 2008
- journal article
- research article
- Published by Elsevier in Operations Research Letters
- Vol. 36 (1) , 31-36
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- Which Problems Have Strongly Exponential Complexity?Journal of Computer and System Sciences, 2001
- Parameterized Complexity1999