A 4/3-approximation for TSP on cubic 3-edge-connected graphs
Nishita Aggarwal, Naveen Garg, Swati Gupta
TL;DR
This paper presents a polynomial-time algorithm that approximates the Traveling Salesman Problem within a factor of 4/3 for a specific class of graphs, namely cubic 3-edge-connected graphs.
Contribution
It introduces the first 4/3-approximation algorithm for TSP on metrics derived from cubic 3-edge-connected graphs.
Findings
Achieves a 4/3 approximation ratio for TSP on the specified graph class.
Provides polynomial-time algorithm applicable to the metric completion of cubic 3-edge-connected graphs.
Advances understanding of TSP approximations on special graph classes.
Abstract
We provide a polynomial time 4/3 approximation algorithm for TSP on metrics arising from the metric completion of cubic 3-edge connected graphs.
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.
Taxonomy
TopicsAdvanced Graph Theory Research · Complexity and Algorithms in Graphs · Graph Labeling and Dimension Problems