Approximation hardness of graphic TSP on cubic graphs

@article{Karpinski2013ApproximationHO,
  title={Approximation hardness of graphic TSP on cubic graphs},
  author={M. Karpinski and R. Schmied},
  journal={RAIRO Oper. Res.},
  year={2013},
  volume={49},
  pages={651-668}
}
  • M. Karpinski, R. Schmied
  • Published 2013
  • Mathematics, Computer Science
  • RAIRO Oper. Res.
  • 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. 
    12 Citations

    Figures, Tables, and Topics from this paper

    Graphic TSP in Cubic Graphs
    • 4
    • PDF
    Graphic TSP in 2-connected cubic graphs
    • 1
    • PDF
    TSP Tours in Cubic Graphs: Beyond 4/3
    • 24
    • PDF
    Approximation Taxonomy of Metric TSP
    • 1
    • Highly Influenced
    • PDF
    Approximability of TSP on Power Law Graphs
    • 1
    • PDF
    Beating the Integrality Ratio for s-t-Tours in Graphs
    • Vera Traub, J. Vygen
    • Mathematics, Computer Science
    • 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS)
    • 2018
    • 4
    • PDF
    On Approximability of Bounded Degree Instances of Selected Optimization Problems
    • PDF
    Approximation Taxonomy of Metric TSP ( Update : April 2015 )
    • Highly Influenced
    • PDF

    References

    SHOWING 1-10 OF 32 REFERENCES
    An improved upper bound for the TSP in cubic 3-edge-connected graphs
    • 51
    • PDF
    TSP on Cubic and Subcubic Graphs
    • 38
    • PDF
    On Some Tighter Inapproximability Results (Extended Abstract)
    • 176
    The traveling salesman problem on cubic and subcubic graphs
    • 37
    • PDF
    On Some Tighter Inapproximability Results
    • 260
    TSP Tours in Cubic Graphs: Beyond 4/3
    • 24
    • PDF
    The Planar Hamiltonian Circuit Problem is NP-Complete
    • 494
    Approximating Graphic TSP by Matchings
    • Tobias Mömke, O. Svensson
    • Mathematics, Computer Science
    • 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science
    • 2011
    • 120
    • PDF