An O(log n/ log log n)-approximation Algorithm for the Asymmetric Traveling Salesman Problem

@inproceedings{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},
  booktitle={SODA},
  year={2010}
}
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. 

Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 123 CITATIONS

Approximating ATSP by Relaxing Connectivity

  • 2015 IEEE 56th Annual Symposium on Foundations of Computer Science
  • 2015
VIEW 5 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Combinatorial Semi-Bandits with Knapsacks

VIEW 7 EXCERPTS
CITES METHODS, RESULTS & BACKGROUND
HIGHLY INFLUENCED

Algorithm Engineering

  • Lecture Notes in Computer Science
  • 2016
VIEW 7 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Better $s$-$t$-Tours by Gao Trees

VIEW 4 EXCERPTS
HIGHLY INFLUENCED

A near-optimal approximation algorithm for Asymmetric TSP on embedded graphs

  • Symposium on Computational Geometry
  • 2013
VIEW 8 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

An Improved Integrality Gap for Asymmetric TSP Paths

VIEW 9 EXCERPTS
CITES METHODS, BACKGROUND & RESULTS
HIGHLY INFLUENCED

FILTER CITATIONS BY YEAR

2009
2019

CITATION STATISTICS

  • 28 Highly Influenced Citations

  • Averaged 10 Citations per year from 2017 through 2019

References

Publications referenced by this paper.
SHOWING 1-10 OF 23 REFERENCES

The Traveling-Salesman Problem and Minimum Spanning Trees

  • Operations Research
  • 1970
VIEW 7 EXCERPTS
HIGHLY INFLUENTIAL

In preparation. Current version available at http://mypage.iu.edu/ ̃rdlyons

R. Lyons, Y. Peres
  • Probability on Trees and Networks
  • 2009
VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL

Faster Generation of Random Spanning Trees

  • 2009 50th Annual IEEE Symposium on Foundations of Computer Science
  • 2009
VIEW 1 EXCERPT

Minimum Bounded Degree Spanning Trees

  • 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06)
  • 2006

Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs

N.S.H. Kaplan, M. Lewenstein, M. Sviridenko
  • J. ACM, pages 602–626,
  • 2005