Author:
Remy Jan,Spöhel Reto,Weißl Andreas
Publisher
Springer Berlin Heidelberg
Reference13 articles.
1. Agarwal, P.K., Erickson, J.: Geometric range searching and its relatives. In: Chazelle, B., Goodman, J.E., Pollack, R. (eds.) Advances in Discrete and Computational Geometry, Contemporary Mathematics, vol. 223, pp. 1–56. American Mathematical Socienty, Providence, RI (1999)
2. Armon, A., Avidor, A., Schwartz, O.: Cooperative TSP. In: Proceedings of the 14th Annual European Symposium on Algorithms, pp. 40–51 (2006)
3. Arora, S.: Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems. Journal of the ACM 45(5), 753–782 (1998)
4. Arora, S., Raghavan, P., Rao, S.: Approximation schemes for Euclidean k-medians and related problems. In: Proceedings of the 30th Annual ACM Symposium on Theory of Computing, pp. 106–113 (1998)
5. Beasley, J.E., Nascimento, E.: The vehicle routing allocation problem: a unifying framework. TOP 4, 65–86 (1996)