Improved lower and upper bounds for universal TSP in planar metrics

@inproceedings{Hajiaghayi2006ImprovedLA,
  title={Improved lower and upper bounds for universal TSP in planar metrics},
  author={Mohammad Taghi Hajiaghayi and Robert D. Kleinberg and Frank Thomson Leighton},
  booktitle={SODA},
  year={2006}
}
A universal TSP tour of a metric space is a total ordering of the points of the space such that for any finite subset, the tour which visits these points in the given order is not too much longer than the optimal tour. There is a vast literature on the TSP problem, and universal TSP tours have been studied since the 1980's when Bartholdi and Platzman [29] introduced the spacefilling curve heuristic for the Euclidean TSP problem and conjectured that there exists a constant-competitive universal… CONTINUE READING
Highly Cited
This paper has 33 citations. REVIEW CITATIONS