{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,9]],"date-time":"2024-08-09T20:28:27Z","timestamp":1723235307580},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2007,10,17]],"date-time":"2007-10-17T00:00:00Z","timestamp":1192579200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2008,4]]},"DOI":"10.1007\/s00224-007-9081-y","type":"journal-article","created":{"date-parts":[[2007,10,16]],"date-time":"2007-10-16T10:51:30Z","timestamp":1192531890000},"page":"289-305","source":"Crossref","is-referenced-by-count":7,"title":["Grasp and Delivery for Moving Objects on Broken Lines"],"prefix":"10.1007","volume":"42","author":[{"given":"Yuichi","family":"Asahiro","sequence":"first","affiliation":[]},{"given":"Eiji","family":"Miyano","sequence":"additional","affiliation":[]},{"given":"Shinichi","family":"Shimoirisa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,10,17]]},"reference":[{"key":"9081_CR1","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, Amsterdam (1999)"},{"issue":"16","key":"9081_CR2","doi-asserted-by":"crossref","first-page":"2247","DOI":"10.1016\/j.dam.2006.04.020","volume":"154","author":"Y. Asahiro","year":"2006","unstructured":"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\u20132262 (2006)","journal-title":"Discrete Appl. Math."},{"key":"9081_CR3","unstructured":"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\u2013197, 2005"},{"key":"9081_CR4","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":"9081_CR5","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"},{"issue":"2","key":"9081_CR6","doi-asserted-by":"crossref","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 J. Comput. 31(2), 331\u2013352 (2001)","journal-title":"SIAM J. Comput."},{"key":"9081_CR7","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":"9081_CR8","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":"9081_CR9","doi-asserted-by":"crossref","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. Oper. Res. 40, 342\u2013354 (1992)","journal-title":"Oper. Res."},{"key":"9081_CR10","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"},{"key":"9081_CR11","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":"9081_CR12","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)"},{"key":"9081_CR13","volume-title":"The Traveling Salesman Problem","year":"1985","unstructured":"Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B. (eds.): The Traveling Salesman Problem. Wiley, Chichester (1985)"},{"key":"9081_CR14","doi-asserted-by":"crossref","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. Ann. Discrete Math. 1, 343\u2013362 (1977)","journal-title":"Ann. Discrete Math."},{"key":"9081_CR15","doi-asserted-by":"crossref","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. Manag. Sci. 15, 102\u2013109 (1968)","journal-title":"Manag. Sci."},{"key":"9081_CR16","volume-title":"Computational Complexity","author":"C.H. Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison\u2013Wesley, Reading (1994)"},{"key":"9081_CR17","doi-asserted-by":"crossref","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. J. Sched. 2, 215\u2013227 (1999)","journal-title":"J. Sched."},{"key":"9081_CR18","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)"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-007-9081-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-007-9081-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-007-9081-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T07:51:35Z","timestamp":1558684295000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-007-9081-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,10,17]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2008,4]]}},"alternative-id":["9081"],"URL":"https:\/\/doi.org\/10.1007\/s00224-007-9081-y","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,10,17]]}}}