{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T04:43:17Z","timestamp":1780634597983,"version":"3.54.1"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540671411","type":"print"},{"value":"9783540465416","type":"electronic"}],"license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-46541-3_53","type":"book-chapter","created":{"date-parts":[[2007,8,2]],"date-time":"2007-08-02T12:03:24Z","timestamp":1186056204000},"page":"639-650","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":73,"title":["Online Dial-a-Ride Problems: Minimizing the Completion Time"],"prefix":"10.1007","author":[{"given":"Norbert","family":"Ascheuer","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sven O.","family":"Krumke","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"J\u00f6rg","family":"Rambau","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2000,3,24]]},"reference":[{"key":"53_CR1","doi-asserted-by":"crossref","unstructured":"N. Ascheuer, M. Gr\u00f6tschel, S. O. Krumke, and J. Rambau. Combinatorial online optimization. In Proceedings of the International Conference of Operations Research, pages 21\u201337. Springer, 1998.","DOI":"10.1007\/978-3-642-58409-1_2"},{"issue":"5","key":"53_CR2","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1137\/0217053","volume":"17","author":"M. J. Atallah","year":"1988","unstructured":"M. J. Atallah and S. R. Kosaraju. Efficient solutions to some transportation problems with applications to minimizing robot arm travel. SIAM Journal on Computing, 17(5):849\u2013869, October 1988.","journal-title":"SIAM Journal on Computing"},{"key":"53_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/3-540-58218-5_4","volume-title":"Proceedings of the 4th Scandinavian Workshop on Algorithm Theory","author":"G. Ausiello","year":"1994","unstructured":"G. Ausiello, E. Feuerstein, S. Leonardi, L. Stougie, and M. Talamo. Serving request with on-line routing. In Proceedings of the 4th Scandinavian Workshop on Algorithm Theory, volume 824 of Lecture Notes in Computer Science, pages 37\u201348, July 1994."},{"key":"53_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1007\/3-540-60220-8_63","volume-title":"Proceedings of the 4th Workshop on Algorithms and Data Structures","author":"G. Ausiello","year":"1995","unstructured":"G. Ausiello, E. Feuerstein, S. Leonardi, L. Stougie, and M. Talamo. Competitive algorithms for the traveling salesman. In Proceedings of the 4th Workshop on Algorithms and Data Structures, volume 955 of Lecture Notes in Computer Science, pages 206\u2013217, August 1995."},{"key":"53_CR5","unstructured":"G. Ausiello, E. Feuerstein, S. Leonardi, L. Stougie, and M. Talamo. Algorithms for the on-line traveling salesman. Algorithmica, 1999. To appear."},{"key":"53_CR6","unstructured":"A. Borodin and R. El-Yaniv. Online Computation and Competitive Analysis. Cambridge University Press, 1998."},{"key":"53_CR7","unstructured":"M. Charikar and B. Raghavachari. The finite capacity dial-A-ride problem. In Proceedings of the 39th Annual IEEE Symposium on the Foundations of Computer Science, 1998."},{"key":"53_CR8","volume-title":"Worst-case analysis of a new heuristic for the traveling salesman problem","author":"N. Christofides","year":"1976","unstructured":"N. Christofides. Worst-case analysis of a new heuristic for the traveling salesman problem. Technical report, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, PA, 1976."},{"key":"53_CR9","unstructured":"E. Feuerstein and L. Stougie. On-line single server dial-a-ride problems. Theoretical Computer Science, special issue on on-line algorithms, to appear."},{"issue":"2","key":"53_CR10","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1137\/0207017","volume":"7","author":"G. N. Frederickson","year":"1978","unstructured":"G. N. Frederickson, M. S. Hecht, and C. E. Kim. Approximation algorithms for some routing problems. SIAM Journal on Computing, 7(2):178\u2013193, May 1978.","journal-title":"SIAM Journal on Computing"},{"key":"53_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/3-540-46784-X_6","volume-title":"Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science, Ascona, Switzerland","author":"D. Hauptmeier","year":"1999","unstructured":"D. Hauptmeier, S. O. Krumke, J. Rambau, and H.-C. Wirth. Euler is standing in line. In Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science, Ascona, Switzerland, volume 1665 of Lecture Notes in Computer Science, pages 42\u201354, June 1999."},{"issue":"6","key":"53_CR12","doi-asserted-by":"publisher","first-page":"1313","DOI":"10.1137\/S0097539793248317","volume":"24","author":"D. B. Shmoys","year":"1995","unstructured":"D. B. Shmoys, J. Wein, and D. P. Williamson. Scheduling parallel machines on-line. SIAM Journal on Computing, 24(6):1313\u20131331, December 1995.","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","STACS 2000"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46541-3_53","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T09:49:42Z","timestamp":1558259382000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46541-3_53"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540671411","9783540465416"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-46541-3_53","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2000]]},"assertion":[{"value":"24 March 2000","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}