A (slightly) improved approximation algorithm for metric TSP

@article{Karlin2020AI,
  title={A (slightly) improved approximation algorithm for metric TSP},
  author={Anna R. Karlin and Nathan Klein and S. Gharan},
  journal={Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing},
  year={2020}
}
For some > 10−36 we give a randomized 3/2− approximation algorithm for metric TSP. 
Improving the Approximation Ratio for Capacitated Vehicle Routing
Improving on Best-of-Many-Christofides for T-tours
  • Vera Traub
  • Mathematics, Computer Science
  • Oper. Res. Lett.
  • 2020
Evaluating Curriculum Learning Strategies in Neural Combinatorial Optimization
Capacity lower bounds via productization

References

SHOWING 1-5 OF 5 REFERENCES
Approximating Graphic TSP by Matchings
  • Tobias Mömke, O. Svensson
  • Mathematics, Computer Science
  • 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science
  • 2011
13/9-approximation for Graphic TSP
  • M. Mucha
  • Mathematics, Computer Science
  • STACS
  • 2012
Submodular Functions, Matroids, and Certain Polyhedra
  • J. Edmonds
  • Mathematics, Computer Science
  • Combinatorial Optimization
  • 2001
Negative dependence and the geometry of polynomials
Shorter Tours by Nicer Ears