Sciweavers

SODA
2001
ACM
114views Algorithms» more  SODA 2001»
14 years 27 days ago
Approximation algorithms for TSP with neighborhoods in the plane
In the Euclidean TSP with neighborhoods (TSPN), we are given a collection of n regions (neighborhoods) and we seek a shortest tour that visits each region. As a generalization of ...
Adrian Dumitrescu, Joseph S. B. Mitchell