The Internet Archive has a preservation copy of this work in our general collections.
The file type is
We prove explicit approximation hardness results for the Graphic TSP on cubic and subcubic graphs as well as the new inapproximability bounds for the corresponding instances of the (1,2)-TSP. The proof technique uses new modular constructions of simulating gadgets for the restricted cubic and subcubic instances. The modular constructions used in the paper could be also of independent interest.arXiv:1304.6800v2 fatcat:3pgb67q6prg3deqg7cr65qqmsq