Faster Approximation Scheme for Euclidean $k$-TSP

Ernest van Wijland, Hang Zhou

In the Euclidean $k$-traveling salesman problem ($k$-TSP), we are given $n$ points in the $d$-dimensional Euclidean space, for some fixed constant $d\ge 2$, and a positive integer…