A PTAS for Euclidean TSP with Hyperplane Neighborhoods

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 contrasts the much-better understood case of so-called fat regions. While for $d=2$ an exact algorithm with running time $O(n^5)$ is known, settling the exact approximability of the problem for $d=3$ has been repeatedly posed as an open question. To date, only an approximation algorithm with guarantee exponential in $d$ is known, and NP-hardness remains open. For arbitrary fixed $d$, we develop a Polynomial Time Approximation Scheme (PTAS) that works for both the tour and path version of the problem. Our algorithm is based on approximating the convex hull of the optimal tour by a convex polytope of bounded complexity. Such polytopes are represented as solutions of a sophisticated LP formulation, which we combine with the enumeration of crucial properties of the tour. As the approximation guarantee approaches $1$, our scheme adjusts the complexity of the considered polytopes accordingly. In the analysis of our approximation scheme, we show that our search space includes a sufficiently good approximation of the optimum. To do so, we develop a novel and general sparsification technique to transform an arbitrary convex polytope into one with a constant number of vertices and, in turn, into one of bounded complexity in the above sense. Hereby, we maintain important properties of the polytope.

[1]  Lee-Ad Gottlieb,et al.  A Linear Time Approximation Scheme for Euclidean TSP , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.

[2]  Kurt Mehlhorn,et al.  A Strong and Easily Computable Separation Bound for Arithmetic Expressions Involving Radicals , 2000, Algorithmica.

[3]  Esther M. Arkin,et al.  Approximation Algorithms for the Geometric Covering Salesman Problem , 1994, Discret. Appl. Math..

[4]  Khaled M. Elbassioni,et al.  A QPTAS for TSP with fat weakly disjoint neighborhoods in doubling metrics , 2010, SODA '10.

[5]  Joseph S. B. Mitchell,et al.  A constant-factor approximation algorithm for TSP with pairwise-disjoint connected neighborhoods in the plane , 2010, SCG.

[6]  Mark Sellke Chasing Convex Bodies Optimally , 2020, SODA.

[7]  Nathan Linial,et al.  On convex body chasing , 1993, Discret. Comput. Geom..

[8]  Nimrod Megiddo,et al.  Linear Programming in Linear Time When the Dimension Is Fixed , 1984, JACM.

[9]  Kevin Schewior,et al.  A Tight Lower Bound for Online Convex Optimization with Switching Costs , 2017, WAOA.

[10]  Oded Schwartz,et al.  On the Complexity of Approximating TSP with Neighborhoods and Related Problems , 2003, ESA.

[11]  Joseph S. B. Mitchell,et al.  A PTAS for TSP with neighborhoods among fat regions in the plane , 2007, SODA '07.

[12]  Kirk Pruhs,et al.  Chasing Convex Bodies and Functions , 2016, LATIN.

[13]  F. John Extremum Problems with Inequalities as Subsidiary Conditions , 2014 .

[14]  Sanjeev Arora,et al.  Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems , 1998, JACM.

[15]  Yin Tat Lee,et al.  Competitively chasing convex bodies , 2018, STOC.

[16]  Anupam Gupta,et al.  Chasing Convex Bodies with Linear Competitive Ratio , 2019, SODA.

[17]  Nikhil Bansal,et al.  Nested Convex Bodies are Chaseable , 2017, Algorithmica.

[18]  Svante Carlsson,et al.  Finding the Shortest Watchman Route in a Simple Polygon , 1993, ISAAC.

[19]  Moshe Dror,et al.  Touring a sequence of polygons , 2003, STOC '03.

[20]  Joseph S. B. Mitchell,et al.  A new algorithm for computing shortest paths in weighted planar subdivisions (extended abstract) , 1997, SCG '97.

[21]  Alexander Grigoriev,et al.  On the Minimum Corridor Connection Problem and Other Generalized Geometric Problems , 2006, WAOA.

[22]  Mihalis Yannakakis,et al.  The Traveling Salesman Problem with Distances One and Two , 1993, Math. Oper. Res..

[23]  Timothy M. Chan Faster core-set constructions and data-stream algorithms in fixed dimensions , 2006, Comput. Geom..

[24]  Kirk Pruhs,et al.  A 2-Competitive Algorithm For Online Convex Optimization With Switching Costs , 2015, APPROX-RANDOM.

[25]  Khaled M. Elbassioni,et al.  Approximation Algorithms for the Euclidean Traveling Salesman Problem with Discrete and Continuous Neighborhoods , 2009, Int. J. Comput. Geom. Appl..

[26]  Adrian Dumitrescu The traveling salesman problem for lines and rays in the plane , 2010, CCCG.

[27]  XUEHOU TAN,et al.  Corrigendum to "An Incremental Algorithm for Constructing Shortest Watchman Routes" , 1999, Int. J. Comput. Geom. Appl..

[28]  Nicos Christofides Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem , 1976, Operations Research Forum.

[29]  Timothy M. Chan Improved Deterministic Algorithms for Linear Programming in Low Dimensions , 2016, SODA.

[30]  Kasturi R. Varadarajan,et al.  Geometric Approximation via Coresets , 2007 .

[31]  Moshe Dror,et al.  Combinatorial Optimization with Explicit Delineation of the Ground Set by a Collection of Subsets , 2008, SIAM J. Discret. Math..

[32]  Joseph S. B. Mitchell,et al.  Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems , 1999, SIAM J. Comput..

[33]  Joseph S. B. Mitchell,et al.  Approximation algorithms for TSP with neighborhoods in the plane , 2001, SODA '01.

[34]  Richard P. Brent,et al.  Fast Multiple-Precision Evaluation of Elementary Functions , 1976, JACM.

[35]  K. Ball Ellipsoids of maximal volume in convex bodies , 1990, math/9201217.

[36]  Satish Rao,et al.  Approximating geometrical graphs via “spanners” and “banyans” , 1998, STOC '98.

[37]  Håkan Jonsson The Traveling Salesman Problem for lines in the plane , 2002, Inf. Process. Lett..

[38]  Csaba D. Tóth,et al.  The Traveling Salesman Problem for Lines, Balls, and Planes , 2013, SODA.

[39]  Joachim Gudmundsson,et al.  TSP with Neighborhoods of Varying Size , 2002, ESA.

[40]  Reinhard Klette,et al.  An Approximate Algorithm for Solving the Watchman Route Problem , 2008, RobVis.

[41]  T-H. Hubert Chan,et al.  Reducing Curse of Dimensionality: Improved PTAS for TSP (with Neighborhoods) in Doubling Metrics , 2016, SODA.