Author:
Elbassioni Khaled,Fishkin Aleksei V.,Mustafa Nabil H.,Sitters René
Publisher
Springer Berlin Heidelberg
Reference17 articles.
1. Arkin, E.M., Hassin, R.: Approximation algorithms for the geometric covering salesman problem. Discrete Applied Mathematics 55(3), 197–218 (1994)
2. Arora, S.: Nearly linear time approximation schemes for euclidean TSP and other geometric problems. J. ACM 45(5), 1–30 (1998)
3. Christofides, N.: Worst-case analysis of a new heuristic for the traveling salesman problem. Technical report, GSIA, Carnegie-Mellon University (1976)
4. de Berg, M., Gudmundsson, J., Katz, M.J., Levcopoulos, C., Overmars, M.H., van der Stappen, A.F.: TSP with Neighborhoods of varying size. In: Proceedings 10th Annual European Symposium on algorithms (ESA), pp. 187–199 (2002)
5. Dumitrescu, A., Mitchell, J.S.B.: Approximation algorithms for TSP with neighborhoods in the plane. J. Algorithms 48(1), 135–159 (2003)
Cited by
26 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献