The traveling salesman problem for lines and rays in the plane

In the Euclidean TSP with neighborhoods (TSPN), we are given a collection of n regions (neighborhoods) and we seek a shortest tour that visits each region. In the path variant, we seek a shortest path that visits each region. In this note we present several linear-time approximation algorithms with improved ratios for these problems for two cases of neighborhoods that are (infinite) lines, and respectively, (half-infinite) rays.

• Type: Conference
• Year: 2010
• Where: CCCG
• Authors: Adrian Dumitrescu
• Keywords: CCCG 2010, Computational Geometry, Euclidean TSP, Linear-time Approximation Algorithms, Shortest Tour