A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Improved lower and upper bounds for universal TSP in planar metrics

2006
*
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06
*

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

doi:10.1145/1109557.1109628
fatcat:gdd2kabonjfljn7vamanpd6ria