Approximation Schemes for the Generalized Traveling Salesman Problem

Abstract

The Generalized Traveling Salesman Problem (GTSP) is defined by a weighted graph G = (V,E,w) and a partition of its vertex set into k disjoint clusters V = V₁ ∪... ∪ V_k. It is required to find a minimum-weight cycle that contains exactly one vertex of each cluster. We consider a geometric setting of the problem (we call it the EGTSP-k-GC), in which the vertices of the graph are points in the plane, the weight function corresponds to the Euclidean distances between the points, and the partition into clusters is specified implicitly by means of a regular integer grid with step 1. In this setting, a cluster is a subset of vertices lying in the same cell of the grid; the arising ambiguity is resolved arbitrarily. Even in this special setting, the GTSP remains intractable, generalizing in a natural way the classical planar Euclidean TSP. Recently, a \((1.5 + 8\sqrt 2 + \varepsilon )\)-approximation algorithm with complexity depending polynomially both on the number of vertices n and on the number of clusters k has been constructed for this problem. We propose three approximation schemes for this problem. For each fixed k, all the schemes are polynomial and the complexity of the first two is linear in the number of nodes. Furthermore, the first two schemes remain polynomial for k = O(log n), whereas the third scheme is polynomial for k = n − O(log n).