Approximating 1-dimensional TSP Requires Omega(n log n) Comparisons
Data Structures and Algorithms
2013-03-28 v2
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.
Cite
@article{arxiv.1303.2920,
title = {Approximating 1-dimensional TSP Requires Omega(n log n) Comparisons},
author = {Neal E. Young},
journal= {arXiv preprint arXiv:1303.2920},
year = {2013}
}
Comments
Superseded by "On the complexity of approximating Euclidean traveling salesman tours and minimum spanning trees", by Das et al; Algorithmica 19:447-460 (1997)