Author:
Guo Jiong,Hermelin Danny,Komusiewicz Christian
Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. Aarts, E.H.L., Lenstra, J.K.: Local Search in Combinatorial Optimization. Wiley-Interscience (1997)
2. Balas, E.: New classes of efficiently solvable generalized traveling salesman problems. Ann. Oper. Res. 86, 529–558 (1999)
3. Chen, J., Chor, B., Fellows, M., Huang, X., Juedes, D.W., Kanj, I.A., Xia, G.: Tight lower bounds for certain parameterized NP-hard problems. Inform. Comput. 201(2), 216–231 (2005)
4. Lecture Notes in Computer Science;M. Dörnfelder,2011
5. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer (1999)