Beyond Steiner's problem: a VLSI oriented generalization
WG '89 Proceedings of the fifteenth international workshop on Graph-theoretic concepts in computer science
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
A tight analysis of the greedy algorithm for set cover
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
Journal of the ACM (JACM)
A polylogarithmic approximation algorithm for the group Steiner tree problem
Journal of Algorithms
TSP with Neighborhoods of Varying Size
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Some NP-complete geometric problems
STOC '76 Proceedings of the eighth annual ACM symposium on Theory 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
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
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
Path Planning of Data Mules in Sensor Networks
ACM Transactions on Sensor Networks (TOSN)
Robot routing in sparse wireless sensor networks with continuous ant colony optimization
Proceedings of the 13th annual conference companion on Genetic and evolutionary computation
Algorithms for interval structures with applications
FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
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
Computing shortest heterochromatic monotone routes
Operations Research Letters
An evolutionary approach for the dubins' traveling salesman problem with neighborhoods
Proceedings of the 14th annual conference on Genetic and evolutionary computation
Algorithms for interval structures with applications
Theoretical Computer Science
| Hi-index | 0.00 |
In the Euclidean group Traveling Salesman Problem (TSP), we are given a set of points P in the plane and a set of m connected regions, each containing at least one point of P. We want to find a tour of minimum length that visits at least one point in each region. This unifies the TSP with Neighborhoods and the Group Steiner Tree problem. We give a (9.1α+1)-approximation algorithm for the case when the regions are disjoint α-fat objects with possibly varying size. This considerably improves the best results known, in this case, for both the group Steiner tree problem and the TSP with Neighborhoods problem. We also give the first O(1)-approximation algorithm for the problem with intersecting regions.