Prefer a chat interface with context about you and your work?
Complete Convergence of Short Paths and Karp's Algorithm for the TSP
Let X i , 1 ≤ i < ∞, be uniformly distributed in [0, 1] 2 and let T n be the length of the shortest closed path connecting {X 1 , X 2 , …, X n }. It is proved that there is a constant 0 < β …