# On the Approximability of the Traveling Salesman Problem with Line Neighborhoods

Sándor Kisfaludi-Bak

Abstract:

We study the variant of the Euclidean Traveling Salesman problem where instead of a set of points, we are given a set of lines as input, and the goal is to find the shortest tour that visits each line. The best known upper and lower bounds for the problem in $\mathbb{R}^d$, with $d\ge 3$, are $\mathrm{NP}$-hardness and an $O(\log^3 n)$-...More

Code:

Data: