Approximation Hardness of Graphic TSP on Cubic Graphs
Marek Karpinski, Richard Schmied
TL;DR
This paper establishes new approximation hardness bounds for the Graphic TSP on cubic and subcubic graphs, using innovative modular gadget constructions that could benefit broader research.
Contribution
It provides explicit inapproximability results for Graphic TSP on cubic graphs and introduces novel modular gadget constructions for these instances.
Findings
Proves new approximation hardness bounds for Graphic TSP on cubic graphs
Develops modular gadget constructions for restricted cubic and subcubic instances
Establishes inapproximability bounds for (1,2)-TSP instances
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.