A PTAS for Euclidean TSP with Hyperplane Neighborhoods

  title={A PTAS for Euclidean TSP with Hyperplane Neighborhoods},
  author={A. Antoniadis and K. Fleszar and R. Hoeksma and Kevin Schewior},
  • A. Antoniadis, K. Fleszar, +1 author Kevin Schewior
  • Published in SODA 2019
  • Computer Science, Mathematics
  • In the Traveling Salesperson Problem with Neighborhoods (TSPN), we are given a collection of geometric regions in some space. The goal is to output a tour of minimum length that visits at least one point in each region. Even in the Euclidean plane, TSPN is known to be APX-hard, which gives rise to studying more tractable special cases of the problem. In this paper, we focus on the fundamental special case of regions that are hyperplanes in the $d$-dimensional Euclidean space. This case… CONTINUE READING


    Publications referenced by this paper.
    A PTAS for TSP with neighborhoods among fat regions in the plane
    • 86
    • Highly Influential
    • PDF
    Approximation algorithms for TSP with neighborhoods in the plane
    • 234
    • Highly Influential
    • PDF
    A QPTAS for TSP with fat weakly disjoint neighborhoods in doubling metrics
    • 21
    • PDF
    On the Complexity of Approximating TSP with Neighborhoods and Related Problems
    • 34
    A Linear Time Approximation Scheme for Euclidean TSP
    • 19
    • PDF
    Approximation Algorithms for the Geometric Covering Salesman Problem
    • 285
    TSP with Neighborhoods of Varying Size
    • 40
    • PDF
    Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem
    • 1,308