Approximation Schemes for Subset TSP and Steiner Tree on Geometric Intersection Graphs

We give approximation schemes for Subset TSP and Steiner Tree on unit disk graphs, and more generally, on intersection graphs of similarly sized connected fat (not necessarily convex) polygons in the plane. As a first step towards this goal, we prove spanner-type results: finding an induced subgraph of bounded size that is (1+ε)-equivalent to the original instance in the sense that the optimum value increases only by a factor of at most (1+ε) when the solution can use only the edges in this subgraph. For Subset TSP, our algorithms find a (1+ε)-equivalent induced subgraph of size poly(1/ε)· OPT in polynomial time, and use it to find a (1+ε)-approximate solution in time 2poly(1/ε)· nO(1). For Steiner Tree, our algorithms find a (1+ε)-equivalent induced subgraph of size 2poly(1/ε)· OPT in time 2poly(1/ε)· nO(1), and use it to find a (1+ε)-approximate solution in time 22poly(1/ε)· nO(1). An improved algorithm finds a (1+ε)-approximate solution for Steiner Tree in time 2poly(1/ε)· nO(1). An easy reduction shows that approximation schemes for unit disks imply approximation schemes for planar graphs. Thus our results are far-reaching generalizations of analogous results of Klein [STOC’06] and Borradaile, Klein, and Mathieu [ACM TALG’09] for Subset TSP and Steiner Tree in planar graphs. We show that our results are best possible in the sense that dropping any of (i) similarly sized, (ii) connected, or (iii) fat makes both problems APX-hard.