Corpus ID: 221341075

On the Approximability of the Traveling Salesman Problem with Line Neighborhoods

  title={On the Approximability of the Traveling Salesman Problem with Line Neighborhoods},
  author={A. Antoniadis and S{\'a}ndor Kisfaludi-Bak and B. Laekhanukit and D. Vaz},
  • A. Antoniadis, Sándor Kisfaludi-Bak, +1 author D. Vaz
  • Published 2020
  • Mathematics, Computer Science
  • ArXiv
  • 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)$-approximation algorithm which is based on a reduction to the group Steiner tree problem. We show that TSP with lines in $\mathbb{R}^d$ is APX-hard for any $d\ge… CONTINUE READING

    Figures from this paper.


    A PTAS for Euclidean TSP with Hyperplane Neighborhoods
    • 4
    • PDF
    When Hamming Meets Euclid: The Approximability of Geometric TSP and Steiner Tree
    • L. Trevisan
    • Computer Science, Mathematics
    • SIAM J. Comput.
    • 2000
    • 43
    • PDF
    On the complexity of approximating tsp with neighborhoods and related problems
    • 67
    • PDF
    Combinatorial Optimization with Explicit Delineation of the Ground Set by a Collection of Subsets
    • 15
    • PDF
    A PTAS for TSP with neighborhoods among fat regions in the plane
    • 87
    • PDF
    The traveling salesman problem for lines and rays in the plane
    • 7
    • PDF
    Approximation Algorithms for the Geometric Covering Salesman Problem
    • 288