1. Agarwal, P.K., Sharir, M.: Davenport-Schinzel sequences and their geometric applications. In: Sack, J., Urutia, J. (eds.) Handbook of Computational Geometry. Elsevier, Amsterdam (1999)
2. Asahiro, Y., Horiyama, T., Makino, K., Ono, H., Sakuma, T., Yamashita, M.: How to collect balls moving in the Euclidean plane. Discrete Appl. Math. 154(16), 2247–2262 (2006)
3. Asahiro, Y., Miyano, E., Shimoirisa, S.: K-collect tours for moving objects with release times and deadlines. In: Proc. Systemics, Cybernetics and Informatics, vol. III, pp. 192–197, 2005
4. Bansal, N., Blum, A., Chawla, S., Meyerson, A.: Approximation algorithms for deadline-TSP and vehicle routing with time-windows. In: Proc. ACM Symposium on Theory of Computing, pp. 166–174, 2004
5. Blum, A., Chawla, S., Karger, D., Lane, T., Meyerson, A., Minkoff, M.: Approximation algorithms for orienteering and discounted-reward TSP. In: Proc. IEEE Symposium on Foundations of Computer Science, pp. 46–55, 2003