Approximation algorithms for TSP with neighborhoods in the plane

Authors:
Adrian Dumitrescu;Joseph S. B. Mitchell
Affiliations:
University of Wisconsin--Milwaukee, Milwaukee, WI;Stony Brook University, Stony Brook, NY
Venue:
Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms
Year:
2003

Citing 11
Cited 25

Approximation algorithms for the geometric covering salesman problem

Discrete Applied Mathematics
Approximation algorithms for geometric tour and network design problems (extended abstract)

Proceedings of the eleventh annual symposium on Computational geometry
Approximating geometrical graphs via “spanners” and “banyans”

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems

Journal of the ACM (JACM)
Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems

SIAM Journal on Computing
Linear Programming in Linear Time When the Dimension Is Fixed

Journal of the ACM (JACM)
Fast computation of shortest watchman routes in simple polygons

Information Processing Letters
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
A fast approximation algorithm for TSP with neighborhoods

Nordic Journal of Computing
TSP with Neighborhoods of Varying Size

ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
On the complexity of approximating tsp with neighborhoods and related problems

Computational Complexity

On the complexity of approximating tsp with neighborhoods and related problems

Computational Complexity
Minimum-cost coverage of point sets by disks

Proceedings of the twenty-second annual symposium on Computational geometry
A PTAS for TSP with neighborhoods among fat regions in the plane

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Finding the Optimal Path in 3D Spaces Using EDAs --- The Wireless Sensor Networks Scenario

ICANNGA '07 Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part I
On the minimum corridor connection problem and other generalized geometric problems

Computational Geometry: Theory and Applications
Minimum Covering with Travel Cost

ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Data gathering tours for mobile robots

IROS'09 Proceedings of the 2009 IEEE/RSJ international conference on Intelligent robots and systems
Cooperative TSP

Theoretical Computer Science
A constant-factor approximation algorithm for TSP with pairwise-disjoint connected neighborhoods in the plane

Proceedings of the twenty-sixth annual symposium on Computational geometry
A QPTAS for TSP with fat weakly disjoint neighborhoods in doubling metrics

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Racetrack: an approximation algorithm for the mobile sink routing problem

ADHOC-NOW'10 Proceedings of the 9th international conference on Ad-hoc, mobile and wireless networks
The travelling salesman problem for finite-sized cities†

Mathematical Structures in Computer Science
Fast track article: Designing hierarchical sensor networks with mobile data collectors

Pervasive and Mobile Computing
Path Planning of Data Mules in Sensor Networks

ACM Transactions on Sensor Networks (TOSN)
Self-organizing map for the multi-goal path planning with polygonal goals

ICANN'11 Proceedings of the 21th international conference on Artificial neural networks - Volume Part I
Approximation algorithms for euclidean group TSP

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Minimum-perimeter intersecting polygons

LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
On approximating the TSP with intersecting neighborhoods

ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
On the minimum corridor connection problem and other generalized geometric problems

WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
Efficient data collection from wireless nodes under the two-ring communication model

International Journal of Robotics Research
An evolutionary approach for the dubins' traveling salesman problem with neighborhoods

Proceedings of the 14th annual conference on Genetic and evolutionary computation
Minimum covering with travel cost

Journal of Combinatorial Optimization
Watchman routes for lines and segments

SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Route Planning for Angle Constrained Terrain Mapping Using an Unmanned Aerial Vehicle

Journal of Intelligent and Robotic Systems
Visiting convex regions in a polygonal map

Robotics and Autonomous Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 the classical Euclidean TSP, TSPN is also NP-hard. In this paper, we present new approximation results for the TSPN, including (1) a constant-factor approximation algorithm for the case of arbitrary connected neighborhoods having comparable diameters; and (2) a PTAS for the important special case of disjoint unit disk neighborhoods (or nearly disjoint, nearly-unit disks). Our methods also yield improved approximation ratios for various special classes of neighborhoods, which have previously been studied. Further, we give a linear-time O(1)-approximation algorithm for the case of neighborhoods that are (infinite) straight lines.