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

Authors:
Joseph S.B. Mitchell
Affiliations:
Stony Brook University, Stony Brook, NY, USA
Venue:
Proceedings of the twenty-sixth annual symposium on Computational geometry
Year:
2010

Citing 15
Cited 0

A linear time algorithm with minimum link paths inside a simple polygon

Computer Vision, Graphics, and Image Processing
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
Shortest paths and networks

Handbook of discrete and computational geometry
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
A fast approximation algorithm for TSP with neighborhoods

Nordic Journal of Computing
Approximation algorithms for TSP with neighborhoods in the plane

Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms
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
Orthogonal segment stabbing

Computational Geometry: Theory and Applications - Special issue on the 19th European workshop on computational geometry - EuroCG 03
TSP with neighborhoods of varying size

Journal of Algorithms
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
Approximation algorithms for euclidean group TSP

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
On approximating the TSP with intersecting neighborhoods

ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the Euclidean TSP with neighborhoods (TSPN) problem we seek. shortest tour that visits a given set of n neighborhoods. The Euclidean TSPN generalizes the standard TSP on points. We present the first constant-factor approximation algorithm for planar TSPN with pairwise-disjoint connected neighborhoods of any size or shape. Prior approximation bounds were O(log n), except in special cases.