%0 Journal Article
%J Algorithmica
%D 2000
%T Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem
%A Guttmann-Beck,N.
%A Hassin,R.
%A Khuller, Samir
%A Raghavachari,B.
%X Let G=(V,E) be a complete undirected graph with vertex set V , edge set E , and edge weights l(e) satisfying triangle inequality. The vertex set V is partitioned into clusters V 1 , . . ., V k . The clustered traveling salesman problem is to compute a shortest Hamiltonian cycle (tour) that visits all the vertices, and in which the vertices of each cluster are visited consecutively. Since this problem is a generalization of the traveling salesman problem, it is NP-hard. In this paper we consider several variants of this basic problem and provide polynomial time approximation algorithms for them.
%B Algorithmica
%V 28
%P 422 - 437
%8 2000///
%G eng
%N 4
%R 10.1007/s004530010045