An Improved Integrality Gap for Asymmetric TSP Paths
Zachary Friggstad, Anupam Gupta, and Mohit Singh

TL;DR
This paper improves the known upper bound on the integrality gap for the LP relaxation of the asymmetric TSP path problem from O(log n) to O(log n / log log n), advancing understanding of approximation limits.
Contribution
It establishes a tighter integrality gap bound for ATSPP's LP relaxation and links this bound to a conjecture about thin spanning trees, offering new insights into the problem's structure.
Findings
Improved integrality gap bound from O(log n) to O(log n / log log n)
Constructed a randomized spanning tree using narrow s-t cuts
Provided a family of instances with integrality gap at least 2
Abstract
The Asymmetric Traveling Salesperson Path Problem (ATSPP) is one where, given an asymmetric metric space with specified vertices s and t, the goal is to find an s-t path of minimum length that passes through all the vertices in V. This problem is closely related to the Asymmetric TSP (ATSP), which seeks to find a tour (instead of an path) visiting all the nodes: for ATSP, a -approximation guarantee implies an -approximation for ATSPP. However, no such connection is known for the integrality gaps of the linear programming relaxations for these problems: the current-best approximation algorithm for ATSPP is , whereas the best bound on the integrality gap of the natural LP relaxation (the subtour elimination LP) for ATSPP is . In this paper, we close this gap, and improve the current best bound on the integrality gap from…
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.
