An O(log n/ log log n)-approximation algorithm for the asymmetric traveling salesman problem

@article{Asadpour2010AnON,
  title={An O(log n/ log log n)-approximation algorithm for the asymmetric traveling salesman problem},
  author={Arash Asadpour and Michel X. Goemans and Aleksander Madry and Shayan Oveis Gharan and Amin Saberi},
  journal={Oper. Res.},
  year={2010},
  volume={65},
  pages={1043-1061}
}
We consider the Asymmetric Traveling Salesman problem for costs satisfying the triangle inequality. We derive a randomized algorithm which delivers a solution within a factor O(log n/ log log n) of the optimum with high probability. 
An improved approximation algorithm for TSP in the half integral case
TLDR
A design of a 1.49993-approximation algorithm for the metric traveling salesperson problem (TSP) for instances in which an optimal solution to the subtour linear programming relaxation is half-integral shows that the integrality gap of the subtours polytope is bounded away from 3/2.
New Approaches to the Asymmetric Traveling Salesman and Related Problems
The Asymmetric Traveling Salesman Problem and its variants are optimization problems that are widely studied from the viewpoint of approximation algorithms as well as hardness of approximation. The
Approximation algorithms for mixed, windy, and capacitated arc routing problems
TLDR
It is shown that any alpha(n)-approximation algorithm for the n-vertex metric asymmetric Traveling Salesperson problem yields O(alpha(C), and constant-factor approximations are derived if C is in O(log n) and O( log(C)/log(log(C))-approximations in general.
Ju n 20 19 A Constant-Factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem *
TLDR
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.
Constant factor approximation to the bounded genus instances of ATSP
TLDR
The symmetric traveling salesman problem (STSP) is a special case of ATSP in which the cost function is symmetric (i.e. c(u, v) = c(v, u) and no better approximation algorithm has since been found for the general symmetric metric case.
Effective-Resistance-Reducing Flows, Spectrally Thin Trees, and Asymmetric TSP
  • Nima Anari, S. Gharan
  • Mathematics, Computer Science
    2015 IEEE 56th Annual Symposium on Foundations of Computer Science
  • 2015
TLDR
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.
Constant-factor approximations for asymmetric TSP on nearly-embeddable graphs
TLDR
The approximability of ATSP on topologically restricted graphs is considered, and it is shown that for any class of \emph{nearly-embeddable} graphs, ATSP admits a polynomial-time constant-factor approximation.
A Randomized Rounding Approach to the Traveling Salesman Problem
TLDR
This work gives a (3/2-\eps_0)-approximation algorithm that finds a spanning tree whose cost is upper bounded by the optimum, then it finds the minimum cost Eulerian augmentation (or T-join) of that tree.
Approximating Asymmetric TSP in exponential Time
TLDR
A very simple algorithm is proposed that, for any 0 < e < 1, finds (1+e)-approximation to asymmetric TSP in 2ne−1 time and e−1 · poly(n, log M) space.
Approximation Algorithms for the Metric Asymmetric Traveling Salesman Problem
TLDR
The traveling salesman problem (TSP) is a well-known, commonly studied, and very important NP-hard optimization problem in theoretical computer science, of which symmetric TSP is a special case, and this work will be considering a slightly more general TSP variant, asymmetric T SP, which allows c({ (u, v) 6= c({(v, u)}).
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 57 REFERENCES
An O(log n/ log log n)-approximation Algorithm for the Asymmetric Traveling Salesman Problem
TLDR
A randomized algorithm is derived which delivers a solution within a factor O(log n/ log log n) of the optimum of the Asymmetric Traveling Salesman problem with high probability.
A Randomized Rounding Algorithm for the Asymmetric Traveling Salesman Problem
TLDR
An algorithm for the asymmetric traveling salesman problem on instances which satisfy the triangle inequality is presented and achieves approximation ratio O(log n).
On the worst-case performance of some algorithms for the asymmetric traveling salesman problem
TLDR
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.
The asymmetric traveling salesman problem on graphs with bounded genus
We give a constant factor approximation algorithm for the asymmetric traveling salesman problem when the support graph of the solution of the Held-Karp linear programming relaxation has bounded
A new approximation algorithm for the asymmetric TSP with triangle inequality
TLDR
A polynomial time factor 0.999·log n approximation algorithm is presented for the asymmetric traveling salesperson problem with triangle inequality and it is shown that the solution to this problem is simple and efficient.
On the Integrality Ratio for the Asymmetric Traveling Salesman Problem
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.
A Randomized Rounding Approach to the Traveling Salesman Problem
TLDR
This work gives a (3/2-\eps_0)-approximation algorithm that finds a spanning tree whose cost is upper bounded by the optimum, then it finds the minimum cost Eulerian augmentation (or T-join) of that tree.
Improved Approximation Ratios for Traveling Salesperson Tours and Paths in Directed Graphs
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
Randomized rounding: A technique for provably good algorithms and algorithmic proofs
TLDR
A randomized algorithm for transforming an optimal solution of a relaxed problem into a provably good solution for the 0–1 problem is given and can be extended to provide bounds on the disparity between the rational and 0-1 optima for a given problem instance.
A convex relaxation for the asymmetric TSP
TLDR
The main result is that one can find a fractional solution to the relaxation that is very sparse ( with < 3n edges) and it is shown that in the special case when the underlying graph is Hamiltonian with edge lengths 1 and the (inand out-) degrees of every vertex are each at most 2, a solution toThe relaxation can be rounded to an integral solution (a tour) whose length is at most twice the optimum.
...
1
2
3
4
5
...