TSP with neighborhoods of varying size
From MaRDI portal
Publication:5704854
DOI10.1016/j.jalgor.2005.01.010zbMath1101.68919OpenAlexW2047747795MaRDI QIDQ5704854
Joachim Gudmundsson, A. Frank van der Stappen, Mark T. de Berg, Matthew J. Katz, Mark H. Overmars, Christos Levcopoulos
Publication date: 16 November 2005
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://dspace.library.uu.nl/handle/1874/23937
Related Items (22)
On the minimum corridor connection problem and other generalized geometric problems ⋮ Largest and smallest convex hulls for imprecise points ⋮ Minimum color spanning circle of imprecise points ⋮ Connectivity graphs of uncertainty regions ⋮ Algorithms for interval structures with applications ⋮ A double-loop hybrid algorithm for the traveling salesman problem with arbitrary neighbourhoods ⋮ Facility location problems on graphs with non-convex neighborhoods ⋮ Ordered \(p\)-median problems with neighbourhoods ⋮ Observation routes and external watchman routes ⋮ Minimum-perimeter intersecting polygons ⋮ Constant-Factor Approximation for TSP with Disks ⋮ Minimum color spanning circle in imprecise setup ⋮ A QPTAS for TSP with fat weakly disjoint neighborhoods in doubling metrics ⋮ Optimizing flight trajectory of UAV for efficient data collection in wireless sensor networks ⋮ Algorithms for Interval Structures with Applications ⋮ EXISTENCE AND COMPUTATION OF TOURS THROUGH IMPRECISE POINTS ⋮ Cooperative TSP ⋮ Computing shortest heterochromatic monotone routes ⋮ On the total perimeter of homothetic convex bodies in a convex container ⋮ APPROXIMATION ALGORITHMS FOR THE EUCLIDEAN TRAVELING SALESMAN PROBLEM WITH DISCRETE AND CONTINUOUS NEIGHBORHOODS ⋮ Minimum cost \(b\)-matching problems with neighborhoods ⋮ On minimum- and maximum-weight minimum spanning trees with neighborhoods
This page was built for publication: TSP with neighborhoods of varying size
