# A PTAS for Euclidean TSP with Hyperplane Neighborhoods

@inproceedings{Antoniadis2019APF, title={A PTAS for Euclidean TSP with Hyperplane Neighborhoods}, author={A. Antoniadis and K. Fleszar and R. Hoeksma and Kevin Schewior}, booktitle={SODA}, year={2019} }

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

4 Citations

On the Approximability of the Traveling Salesman Problem with Line Neighborhoods

- Computer Science
- 2020

Fast Heuristics for the 3-D Multi-Goal Path Planning Based on the Generalized Traveling Salesman Problem With Neighborhoods

- Computer Science, Engineering
- 2019

- 3
- PDF

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 45 REFERENCES

A PTAS for TSP with neighborhoods among fat regions in the plane

- Computer Science, Mathematics
- 2007

- 86
- Highly Influential
- PDF

Approximation algorithms for TSP with neighborhoods in the plane

- Computer Science, Mathematics
- 2001

- 234
- Highly Influential
- PDF

Approximation Algorithms for the Euclidean Traveling Salesman Problem with Discrete and Continuous Neighborhoods

- Computer Science, Mathematics
- 2009

- 42
- PDF

The traveling salesman problem: low-dimensionality implies a polynomial time approximation scheme

- Computer Science, Mathematics
- 2012

- 46
- PDF

On the Complexity of Approximating TSP with Neighborhoods and Related Problems

- Computer Science, Mathematics
- 2003

- 34

Approximation Algorithms for the Geometric Covering Salesman Problem

- Mathematics, Computer Science
- 1994

- 285