Department of Computer Science
 
Chair V

 
University of Bonn -> Department of Computer Science -> Chair V
CS-APX-Reports 2014 Copyright 2014 University of Bonn, Department of Computer Science, Abt. V
89157

3.11.2014

Approximation Hardness of Graphic TSP on Cubic Graphs
(Revised Version)
Marek Karpinski and Richard Schmied
[Download PostScript] [Download PDF]

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 result on the Graphic TSP for cubic graphs is the first known inapproximability result on that problem. The proof technique in this paper 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.

Last Change: 11/05/14 at 11:07:17
 Deutsch 		University of Bonn -> Department of Computer Science -> Chair V