Ahn, HK Cheong, O Shin, CS 2024-01-21T09:03:05Z 2024-01-21T09:03:05Z 2021-09-03 2003-05 0925-7721 https://pubs.kist.re.kr/handle/201004/138625 In the Euclidean traveling salesman and buyers problem (TSBP), we are given a set of convex regions in d-dimensional space, and we wish to find a minimum-cost tour that visits all the regions. The cost of a tour depends on the length of the tour itself and on the distance that buyers within each region need to travel to meet the salesman. We show that constant-factor approximations to the TSBP and several similar problems can be obtained by visiting the centers of the smallest enclosing spheres of the regions. (C) 2002 Elsevier Science B.V. All rights reserved. English Elsevier BV Building bridges between convex regions Article 10.1016/S0925-7721(02)00135-9 1 Computational Geometry: Theory and Applications, v.25, no.1-2, pp.161 - 170 Computational Geometry: Theory and Applications 25 1-2 161 170 N scopus 000181567300011 2-s2.0-84867949543 Mathematics, Applied Mathematics Mathematics Article; Proceedings Paper ALGORITHMS euclidean TSP TSP with neighborhoods traveling salesman and buyers problem approximation algorithm