In the Euclidean TSP with neighborhoods (TSPN), we are given a collection ofn regions (neighborhoods) and we seek a shortest tour that visits each region.As a generalization of the classical Euclidean TSP, TSPN is also NP-hard. Inthis paper, we present new approximation results for the TSPN, including (1) aconstant-factor approximation algorithm for the case of arbitrary connectedneighborhoods having comparable diameters; and (2) a PTAS for the importantspecial case of disjoint unit disk neighborhoods (or nearly disjoint,nearly-unit disks). Our methods also yield improved approximation ratios forvarious special classes of neighborhoods, which have previously been studied.Further, we give a linear-time O(1)-approximation algorithm for the case ofneighborhoods that are (infinite) straight lines.