A new approximation algorithm for the asymmetric TSP with triangle inequality

ABSTRACT

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

References

References are not available

Index Terms

• Mathematics of computing

  • Discrete mathematics

    • Graph theory

      • Graph algorithms

• Theory of computation

  • Design and analysis of algorithms

    • Approximation algorithms analysis

      • Scheduling algorithms

    • Online algorithms

      • Online learning algorithms

        • Scheduling algorithms

  • Theory and algorithms for application domains

    • Machine learning theory

      • Reinforcement learning

        • Sequential decision making