4/3-Approximation of Graphic TSP
Ali \c{C}ivril
TL;DR
This paper presents a 4/3-approximation algorithm for the graphic TSP, improving the efficiency of finding near-optimal tours in unweighted graphs by leveraging minimum perfect matchings.
Contribution
It introduces a novel 4/3-approximation algorithm for graphic TSP using minimum perfect matchings on specific subgraphs.
Findings
Achieves a 4/3 approximation ratio for graphic TSP
Utilizes minimum cost perfect matching on odd degree vertices
Provides a new approach based on 2-edge-connected spanning subgraphs
Abstract
We describe a -approximation algorithm for the traveling salesman problem in which the distances between points are induced by graph-theoretical distances in an unweighted graph. The algorithm is based on finding a minimum cost perfect matching on the odd degree vertices of a carefully computed 2-edge-connected spanning subgraph.
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
TopicsVehicle Routing Optimization Methods · Advanced Graph Theory Research · Optimization and Packing Problems