# An improved approximation algorithm for ATSP

@article{Traub2020AnIA,
title={An improved approximation algorithm for ATSP},
author={Vera Traub and Jens Vygen},
journal={Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing},
year={2020}
}
• Published 2 December 2019
• Computer Science, Mathematics
• Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing
We revisit the constant-factor approximation algorithm for the asymmetric traveling salesman problem by Svensson, Tarnawski, and Végh [STOC 2018]. We improve on each part of this algorithm. We avoid the reduction to irreducible instances and thus obtain a simpler and much better reduction to vertebrate pairs. We also show that a slight variant of their algorithm for vertebrate pairs has a much smaller approximation ratio. Overall we improve the approximation ratio from 506 to 22+ε for any ε > 0…
11 Citations

## Figures from this paper

A Constant-factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem
• Mathematics, Computer Science
J. ACM
• 2020
A constant-factor approximation algorithm for the asymmetric traveling salesman problem (ATSP) is given, showing that any algorithm for Subtour Partition Cover can be turned into an algorithm for ATSP while only losing a small constant factor in the performance guarantee.
A constant-factor approximation algorithm for the asymmetric traveling salesman problem
• Computer Science, Mathematics
STOC
• 2018
We give a constant-factor approximation algorithm for the asymmetric traveling salesman problem. Our approximation guarantee is analyzed with respect to the standard LP relaxation, and thus our
Fast Approximation Algorithms for Bounded Degree and Crossing Spanning Tree Problems
• Mathematics, Computer Science
APPROX-RANDOM
• 2021
A fast near-linear time implementation of swap-rounding in the spanning tree polytope of a graph and a fractional solution that can be used to sparsify the input graph and lead to significantly faster approximation algorithms than known before.
A Constant-Factor Approximation for Directed Latency in Quasi-Polynomial Time
• Mathematics, Computer Science
ESA
• 2020
The first constant-factor approximation for the Directed Latency problem in quasi-polynomial time is given, and the standard Asymmetric TSP-Path integrality gap is shown to be bounded by a constant.
A 2-Approximation Algorithm for the Complementary Maximal Strip Recovery Problem
• Mathematics, Computer Science
CPM
• 2019
A new approximation algorithm for the Complementary Maximal Strip Recovery (CMSR) problem is presented, improving the currently best 7/3-approximation algorithm.
A 3/2-Approximation for the Metric Many-visits Path TSP
• Mathematics, Computer Science
ArXiv
• 2020
A polynomial-time algorithm to compute a connected, degree bounded multigraph of minimum cost and a $\frac32$-approximation for the problem of scheduling classes of jobs with sequence-dependent setup times on a single machine so as to minimize the makespan.
Approximation Algorithms for the Single Robot Line Coverage Problem
• Computer Science
WAFR
• 2021
This work considers here the line coverage problem for a single robot where the service and deadhead costs are treated separately, and are asymmetric, and presents approximation algorithms to obtain bounded solutions efficiently, using the minimum cost flow problem.
Approximation Algorithms for the Bottleneck Asymmetric Traveling Salesman Problem
• Computer Science
ACM Trans. Algorithms
• 2021
It is shown how the first nontrivial approximation algorithm for the bottleneck asymmetric traveling salesman problem yields stronger approximation bounds in some cases, such as the bounded orientable genus case studied by Oveis Gharan and Saberi.
From Symmetry to Asymmetry: Generalizing TSP Approximations by Parametrization
• Computer Science, Mathematics
FCT
• 2021
The tree doubling and Christofides algorithm are generalized and a parameterized 3-approximation is derived, where the parameter is the number of asymmetric edges in a given minimum spanning arborescence, which yields algorithms to efficiently compute constant factor approximations also for moderately asymmetric TSP instances.

## References

SHOWING 1-10 OF 47 REFERENCES
A constant-factor approximation algorithm for the asymmetric traveling salesman problem
• Computer Science, Mathematics
STOC
• 2018
We give a constant-factor approximation algorithm for the asymmetric traveling salesman problem. Our approximation guarantee is analyzed with respect to the standard LP relaxation, and thus our
Approximating ATSP by Relaxing Connectivity
• O. Svensson
• Mathematics, Computer Science
2015 IEEE 56th Annual Symposium on Foundations of Computer Science
• 2015
It is shown that any algorithm (irrespective of the metric) for the relaxed problem can be turned into an algorithm for the asymmetric traveling salesman problem by only losing a small constant factor in the performance guarantee.
Constant Factor Approximation for ATSP with Two Edge Weights - (Extended Abstract)
• Computer Science, Mathematics
IPCO
• 2016
This paper gives a constant factor approximation algorithm for the Asymmetric Traveling Salesman Problem on shortest path metrics of directed graphs with two different edge weights based on a flow decomposition theorem for solutions of the Held-Karp relaxation.
Constant factor approximation for ATSP with two edge weights
• Computer Science
Math. Program.
• 2018
A constant factor approximation algorithm is given for the Asymmetric Traveling Salesman Problem on shortest path metrics of directed graphs with two different edge weights based on a flow decomposition theorem for solutions of the Held–Karp relaxation, which may be of independent interest.
Improved Approximation Ratios for Traveling Salesperson Tours and Paths in Directed Graphs
• Mathematics, Computer Science
APPROX-RANDOM
• 2007
In metric asymmetric traveling salesperson problems the input is a complete directed graph in which edge weights satisfy the triangle inequality, and one is required to find a minimum weight walk
Effective-Resistance-Reducing Flows, Spectrally Thin Trees, and Asymmetric TSP
• Mathematics, Computer Science
2015 IEEE 56th Annual Symposium on Foundations of Computer Science
• 2015
This work proves that any k-edge-connected unweighted graph has a polyloglog(n)/k-thin spanning tree, and uses the extension of the seminal work of Marcus, Spielman, and Srivastava to prove the existence of a poly loglog(k/k-spectrally thin tree with respect to D.
On the worst-case performance of some algorithms for the asymmetric traveling salesman problem
• Mathematics, Computer Science
Networks
• 1982
This work considers the asymmetric traveling salesman problem for which the triangular inequality is satisfied, and constructs examples to show that the worst-case ratio of length of tour found to minimum length tour is (n) for n city problems.
Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs
• Mathematics, Computer Science
JACM
• 2005
It is proved that if the d-regular multigraph does not contain more than ⌊d/2⌋ copies of any 2-cycle then it can be found a similar decomposition into n2 pairs of cycle covers where each 2- cycle occurs in at most one component of each pair.
The asymmetric traveling salesman path LP has constant integrality ratio
• Computer Science, Mathematics
IPCO
• 2019
We show that the classical LP relaxation of the asymmetric traveling salesman path problem (ATSPP) has constant integrality ratio. If $$\rho _{\text {ATSP}}$$ and $$\rho _{\text {ATSPP}}$$ denote the
On the Integrality Ratio for the Asymmetric Traveling Salesman Problem
• Mathematics, Computer Science
Math. Oper. Res.
• 2006
We improve the lower bound on the integrality ratio of the Held-Karp bound for asymmetric TSP with triangle inequality from 4/3 to 2.