TY - GEN
T1 - TSP with neighborhoods of Varying size
AU - de Berg, Mark
AU - Gudmundsson, Joachim
AU - Katz, Matthew J.
AU - Levcopoulos, Christos
AU - Overmars, Mark H.
AU - van der Stappen, A. Frank
N1 - Funding Information:
* Corresponding author. E-mail addresses: m.t.d.berg@tue.nl (M. de Berg), joachim.gudmundsson@nicta.com.au (J. Gudmundsson), matya@cs.bgu.ac.il (M.J. Katz), christos@cs.lth.se (C. Levcopoulos), markov@cs.uu.nl (M.H. Overmars), frankst@cs.uu.nl (A.F. van der Stappen). 1 National ICT Australia is funded by the Australian Government’s Backing Australia’s Ability initiative, in part through the Australian Research Council. 2 Supported by grant no. 2000160 from the US–Israel Binational Science Foundation.
Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2002.
PY - 2002/1/1
Y1 - 2002/1/1
N2 - In TSP with neighborhoods we are given a set of objects in the plane, called neighborhoods, and we seek the shortest tour that visits all neighborhoods. Until now constant-factor approximation algorithms have been known only for cases where the objects are of approximately the same size. We present the first polynomial-time constant-factor approximation algorithm for disjoint convex fat objects of arbitrary size. We also show that the problem is APX-hard and cannot be approximated within a factor of 391/390 in polynomial time, unless P = NP.
AB - In TSP with neighborhoods we are given a set of objects in the plane, called neighborhoods, and we seek the shortest tour that visits all neighborhoods. Until now constant-factor approximation algorithms have been known only for cases where the objects are of approximately the same size. We present the first polynomial-time constant-factor approximation algorithm for disjoint convex fat objects of arbitrary size. We also show that the problem is APX-hard and cannot be approximated within a factor of 391/390 in polynomial time, unless P = NP.
UR - http://www.scopus.com/inward/record.url?scp=84938061920&partnerID=8YFLogxK
U2 - 10.1007/3-540-45749-6_20
DO - 10.1007/3-540-45749-6_20
M3 - Conference contribution
AN - SCOPUS:84938061920
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 187
EP - 199
BT - Algorithms - ESA 2002 - 10th Annual European Symposium, Proceedings
A2 - Möhring, Rolf
A2 - Raman, Rajeev
PB - Springer Verlag
T2 - 10th Annual European Symposium on Algorithms, ESA 2002
Y2 - 17 September 2002 through 21 September 2002
ER -