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.Comment: Superseded by "On the complexity of approximating Euclidean traveling
salesman tours and minimum spanning trees", by Das et al; Algorithmica
19:447-460 (1997
