Approximating 1-dimensional TSP Requires Omega(n log n) Comparisons
We give a short proof that any comparison-based n^(1-epsilon)-approximation algorithm for the 1-dimensional Traveling Salesman Problem (TSP) requires Omega(n log n) comparisons.