A new approximation algorithm for the asymmetric TSP with triangle inequality

Markus BläserSODA 2003 · OpenReview

Abstract

We present a polynomial time factor 0.999·log n approximation algorithm for the asymmetric traveling salesperson problem with triangle inequality.
BibTeX
@inproceedings{blaser2003new,
  author = {Markus Bläser},
  title = {{A new approximation algorithm for the asymmetric TSP with triangle inequality}},
  booktitle = {SODA},
  year = {2003},
  url = {https://openreview.net/forum?id=9zulUo5fmm},
}

Loading related content...

Figure