Approximating 1-dimensional TSP Requires Omega(n log n) Comparisons
classification
💻 cs.DS
keywords
comparisonsdimensionalomegarequiresalgorithmapproximatingapproximationcomparison-based
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.