The Parameterized Complexity of Local Search for TSP, More Refined

DOI10.1007/978-3-642-25591-5_63zbMath1350.68141OpenAlexW1544629871MaRDI QIDQ3104663

Jiong Guo, Rolf Niedermeier, Ondřej Suchý, Sepp Hartung

Publication date: 16 December 2011

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-25591-5_63

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

Local search for string problems: brute-force is essentially optimal

This page was built for publication: The Parameterized Complexity of Local Search for TSP, More Refined