The asymmetric traveling salesman path LP has constant integrality ratio
Anna K\"ohne, Vera Traub, Jens Vygen

TL;DR
This paper proves that the LP relaxation for the asymmetric traveling salesman path problem has a constant integrality ratio, providing bounds related to the asymmetric TSP and its path version, especially for node-weighted instances.
Contribution
It establishes a constant integrality ratio for the LP relaxation of ATSPP and improves bounds for node-weighted instances, also relating unweighted digraphs to node-weighted cases.
Findings
LP relaxation of ATSPP has constant integrality ratio.
Bound for node-weighted instances: at most 2 times the ATSP ratio minus 1.
Lower bound of 2 on integrality ratio for unweighted digraph instances.
Abstract
We show that the classical LP relaxation of the asymmetric traveling salesman path problem (ATSPP) has constant integrality ratio. If and denote the integrality ratios for the asymmetric TSP and its path version, then . We prove an even better bound for node-weighted instances: if the integrality ratio for ATSP on node-weighted instances is , then the integrality ratio for ATSPP on node-weighted instances is at most . Moreover, we show that for ATSP node-weighted instances and unweighted digraph instances are almost equivalent. From this we deduce a lower bound of 2 on the integrality ratio of unweighted digraph instances.
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 · Vehicle Routing Optimization Methods
