Approximation Hardness of Graphic TSP on Cubic Graphs
Computational Complexity
2013-05-15 v2 Discrete Mathematics
Data Structures and Algorithms
Combinatorics
Optimization and Control
Abstract
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.
Keywords
Cite
@article{arxiv.1304.6800,
title = {Approximation Hardness of Graphic TSP on Cubic Graphs},
author = {Marek Karpinski and Richard Schmied},
journal= {arXiv preprint arXiv:1304.6800},
year = {2013}
}