TL;DR
This paper presents a new, simpler proof that improves the known inapproximability threshold for the Traveling Salesman Problem from 220/219 to 185/184, advancing understanding of its computational hardness.
Contribution
It introduces an alternative, simpler inapproximability proof for TSP that improves the known bound using a different construction and existing CSP techniques.
Findings
Improved inapproximability bound to 185/184 for TSP
Simpler proof construction compared to previous methods
Relies on bounded occurrence CSPs for the reduction
Abstract
The Traveling Salesman Problem is one of the most studied problems in computational complexity and its approximability has been a long standing open question. Currently, the best known inapproximability threshold known is 220/219 due to Papadimitriou and Vempala. Here, using an essentially different construction and also relying on the work of Berman and Karpinski on bounded occurrence CSPs, we give an alternative and simpler inapproximability proof which improves the bound to 185/184.
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.