Sciweavers

CORR
2011
Springer
256views Education» more  CORR 2011»
13 years 6 months ago
Approximating Graphic TSP by Matchings
We present a framework for approximating the metric TSP based on a novel use of matchings. Traditionally, matchings have been used to add edges in order to make a given graph Eule...
Tobias Mömke, Ola Svensson
ORL
2008
86views more  ORL 2008»
13 years 11 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