A new approximation algorithm for the asymmetric TSP with triangle inequality-Reference-Cited by-同舟云学术

A new approximation algorithm for the asymmetric TSP with triangle inequality

Published:2008-08 Issue:4 Volume:4 Page:1-15
ISSN:1549-6325
Container-title:ACM Transactions on Algorithms
language:en
Short-container-title:ACM Trans. Algorithms

Author:

Bläser Markus¹

Affiliation:

1. Saarland University, Saarbrücken, Germany

Abstract

We present a polynomial time factor 0.999 ċ log n approximation algorithm for the asymmetric traveling salesperson problem with triangle inequality.

Publisher

Association for Computing Machinery (ACM)

Subject

Mathematics (miscellaneous)

Link

https://dl.acm.org/doi/pdf/10.1145/1383369.1383378

Reference21 articles.

1. A 3/4-Approximation Algorithm for Maximum ATSP with Weights Zero and One

2. Approximating Maximum Weight Cycle Covers in Directed Graphs with Weights Zero and One

3. Bläser M. Manthey B. and Sgall J. An improved approximation algorithm for the asymmetric TSP with strengthened triangle inequality. J. Discrete Algor. To appear. Bläser M. Manthey B. and Sgall J. An improved approximation algorithm for the asymmetric TSP with strengthened triangle inequality. J. Discrete Algor. To appear.

Cited by 20 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Tripoline;Proceedings of the Sixteenth European Conference on Computer Systems;2021-04-21

2. New graph algorithms via polyhedral techniques;it - Information Technology;2021-04-15

3. A Constant-factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem;Journal of the ACM;2020-11-16

4. Requirements And Technologies Towards Uam: Communication, Navigation, And Surveillance;2020 Integrated Communications Navigation and Surveillance Conference (ICNS);2020-09

5. Minimizing the Duration of Repetitive Construction Processes with Work Continuity Constraints;Computation;2019-03-06