A (Slightly) Improved Approximation Algorithm for Metric TSP

July 02, 2020 ยท Declared Dead ยท ๐Ÿ› Symposium on the Theory of Computing

๐Ÿ‘ป CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Anna R. Karlin, Nathan Klein, Shayan Oveis Gharan arXiv ID 2007.01409 Category cs.DS: Data Structures & Algorithms Cross-listed math.CO, math.PR Citations 165 Venue Symposium on the Theory of Computing Last Checked 1 month ago
Abstract
For some $ฮต> 10^{-36}$ we give a randomized $3/2-ฮต$ approximation algorithm for metric TSP.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

๐Ÿ“œ Similar Papers

In the same crypt โ€” Data Structures & Algorithms

Died the same way โ€” ๐Ÿ‘ป Ghosted