{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:27:32Z","timestamp":1725550052776},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540291060"},{"type":"electronic","value":"9783540320241"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11560586_5","type":"book-chapter","created":{"date-parts":[[2005,10,20]],"date-time":"2005-10-20T14:08:27Z","timestamp":1129817307000},"page":"36-50","source":"Crossref","is-referenced-by-count":2,"title":["Pickup and Delivery for Moving Objects on Broken Lines"],"prefix":"10.1007","author":[{"given":"Yuichi","family":"Asahiro","sequence":"first","affiliation":[]},{"given":"Eiji","family":"Miyano","sequence":"additional","affiliation":[]},{"given":"Shinichi","family":"Shimoirisa","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","volume-title":"The Vehicle Routing Problem","author":"P. Toth","year":"2001","unstructured":"Toth, P., Vigo, D.: An overview of vehicle routing problems. In: Tosh, P., Vigo, D. (eds.) The Vehicle Routing Problem. SIAM, Philadelphia (2001)"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"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\u2013174 (2004)","DOI":"10.1145\/1007352.1007385"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"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\u201355 (2003)","DOI":"10.1109\/SFCS.2003.1238180"},{"key":"5_CR4","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1287\/opre.40.2.342","volume":"40","author":"M. Desrochers","year":"1992","unstructured":"Desrochers, M., Desrosiers, J., Solomon, M.M.: A new optimization algorithm for the vehicle routing problem with time windows. Operations Research\u00a040, 342\u2013354 (1992)","journal-title":"Operations Research"},{"volume-title":"The traveling salesman problem","year":"1985","key":"5_CR5","unstructured":"Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B. (eds.): The traveling salesman problem. Wiley, Chichester (1985)"},{"key":"5_CR6","unstructured":"Chalasani, P., Motwani, R., Rao, A.: Approximation algorithms for robot grasp and delivery. In: Proc. International Workshop on Algorithmic Foundations of Robotics, pp. 347\u2013362 (1996)"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Helvig, C.S., Robins, G., Zelikovsky, A.: Moving target TSP and related problems. In: Proc. European Symposium on Algorithms, pp. 453\u2013464 (1998)","DOI":"10.1007\/3-540-68530-8_38"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Hammar, M., Nilsson, B.J.: Approximation results for kinetic variants of TSP. In: Proc. International Colloquium on Automata, Languages and Programming, pp. 392\u2013401 (1999)","DOI":"10.1007\/3-540-48523-6_36"},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/j.entcs.2003.12.015","volume":"91","author":"Y. Asahiro","year":"2004","unstructured":"Asahiro, Y., Horiyama, T., Makino, K., Ono, H., Sakuma, T., Yamashita, M.: How to collect balls moving in the Euclidean plane. Electronic Notes in Theoretical Computer Science\u00a091, 229\u2013245 (2004)","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"5_CR10","unstructured":"Asahiro, Y., Miyano, E., Shimoirisa, S.: K-collect tours for moving objects with release times and deadlines. In: To appear in Proc. Systemics, Cybernetics and Informatics (2005)"},{"key":"5_CR11","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/S0167-5060(08)70743-X","volume":"1","author":"J.K. Lenstra","year":"1977","unstructured":"Lenstra, J.K., Rinnooy Kan, A.H.G., Brucker, P.: Complexity of machine scheduling problems. Annals of Discrete Mathematics\u00a01, 343\u2013362 (1977)","journal-title":"Annals of Discrete Mathematics"},{"key":"5_CR12","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1287\/mnsc.15.1.102","volume":"15","author":"J.M. Moore","year":"1968","unstructured":"Moore, J.M.: An n job, one machine sequencing algorithm for minimizing the number of late jobs. Management Science\u00a015, 102\u2013109 (1968)","journal-title":"Management Science"},{"key":"5_CR13","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1002\/(SICI)1099-1425(199909\/10)2:5<215::AID-JOS27>3.0.CO;2-Y","volume":"2","author":"F.C.R. Spieksma","year":"1999","unstructured":"Spieksma, F.C.R.: On the approximability of an interval scheduling problem. Journal of Scheduling\u00a02, 215\u2013227 (1999)","journal-title":"Journal of Scheduling"},{"key":"5_CR14","volume-title":"Handbook of Algorithms and Theory of Computation","author":"D. Karger","year":"1997","unstructured":"Karger, D., Stein, C., Wein, J.: Scheduling algorithms. In: Atallah, M.J. (ed.) Handbook of Algorithms and Theory of Computation. CRC Press, Boca Raton (1997)"},{"issue":"2","key":"5_CR15","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1137\/S0097539799354138","volume":"31","author":"A. Bar-Noy","year":"2001","unstructured":"Bar-Noy, A., Guha, S., Naor, J., Schieber, B.: Approximating the throughput of multiple machines under real-time scheduling. SIAM Journal on Computing\u00a031(2), 331\u2013352 (2001)","journal-title":"SIAM Journal on Computing"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Chuzhoy, J., Ostrovsky, R., Rabani, Y.: Approximation algorithms for the job interval selection problem and related scheduling problem. In: Proc. IEEE Symposium on Foundations of Computer Science, pp. 348\u2013356 (2001)","DOI":"10.1109\/SFCS.2001.959909"},{"key":"5_CR17","volume-title":"Handbook of Computational Geometry","author":"P.K. Agarwal","year":"1999","unstructured":"Agarwal, P.K., Sharir, M.: Davenport-Schinzel sequences and their geometric applications. In: Sack, J., Urutia, J. (eds.) Handbook of Computational Geometry. Elsevier Science, Amsterdam (1999)"},{"key":"5_CR18","volume-title":"Computational Complexity","author":"C.H. Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1994)"}],"container-title":["Lecture Notes in Computer Science","Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11560586_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:13:21Z","timestamp":1619507601000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11560586_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540291060","9783540320241"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/11560586_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}