125 citations · 360 across the 21 of their papers we have counts for
1 paper · 1 filter
Yair Bartal, Lee-Ad Gottlieb, Robert Krauthgamer
The Traveling Salesman Problem (TSP) is among the most famous NP-hard optimization problems. We design for this problem a randomized polynomial-time algorithm that computes a (1+ep…