Conference ProceedingsOPEN ACCESS

A (slightly) improved approximation algorithm for metric TSP

Proceedings of the Annual ACM Symposium on Theory of Computing (2021) 32-45
DOI: 10.1145/3406325.3451009
129Citations
Citations of this article
18Readers
Mendeley users who have this article in their library.
Get full text

Abstract

For some > 10-36 we give a randomized 3/2- approximation algorithm for metric TSP.

Author supplied keywords

Cite

CITATION STYLE

APA

Karlin, A. R., Klein, N., & Gharan, S. O. (2021). A (slightly) improved approximation algorithm for metric TSP. In Proceedings of the Annual ACM Symposium on Theory of Computing (pp. 32–45). Association for Computing Machinery. https://doi.org/10.1145/3406325.3451009

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free