Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

ICALP

2005

Springer

2005

Springer

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 ﬁnd a tour of minimum length that visits at least one point in each region. This uniﬁes 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 ﬁrst O(1)-approximation algorithm for the problem with intersecting regions.

Related Content

Added |
27 Jun 2010 |

Updated |
27 Jun 2010 |

Type |
Conference |

Year |
2005 |

Where |
ICALP |

Authors |
Khaled M. Elbassioni, Aleksei V. Fishkin, Nabil H. Mustafa, René Sitters |

Comments (0)