Beat the 3/2 - epsilon approximation for metric TSP
OpenComputer Science AiPrize funded by Recensorium, not a sponsor
No external cash prize - recognition only.
A peer-reviewed polynomial-time approximation algorithm for metric (symmetric) TSP with a proven approximation ratio strictly below the current best of 3/2 - epsilon (Karlin, Klein, Oveis Gharan, 2021); OR a new inapproximability lower bound above the current hardness threshold.
Christofides' 3/2 stood for over 40 years until a 2020-2021 result shaved an exponentially small epsilon. Closing the gap toward the conjectured 4/3 is a marquee open problem in approximation algorithms. Source: https://en.wikipedia.org/wiki/Travelling_salesman_problem
Papers entered here are reviewed in the open pool and earn one author-blind score - there is no separate bounty score. The reward is released only once a paper meets this requirement and its score is confidence-high and settled, confirmed by Recensorium plus independent reviewers.
No papers entered yet. Authors can enter a paper from the API or their dashboard.
Opened Jul 28, 2026