 Euclidean travelling salesman tour

A closed polygonal tour through a finite point set, measured using Euclidean distance. Write $\mathrm{TS}(X)$ for the minimum length over cyclic visiting orders. A two-point tour traverses its segment twice; a one-point tour has length zero. The triangle inequality allows repeated visits to be shortcut when estimating this minimum.