{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,9]],"date-time":"2026-03-09T19:17:29Z","timestamp":1773083849417,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540671596","type":"print"},{"value":"9783540465218","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-46521-9_11","type":"book-chapter","created":{"date-parts":[[2007,11,3]],"date-time":"2007-11-03T18:47:16Z","timestamp":1194115636000},"page":"125-136","source":"Crossref","is-referenced-by-count":36,"title":["The Online Dial-a-Ride Problem under Reasonable Load"],"prefix":"10.1007","author":[{"given":"Dietrich","family":"Hauptmeier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sven O.","family":"Krumke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00f6rg","family":"Rambau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2000,2,14]]},"reference":[{"key":"11_CR1","series-title":"Lect Notes Comput Sci","volume-title":"Proceedings of the 17th International Symposium on Theoretical Aspects of Computer Science","author":"N. Ascheuer","year":"2000","unstructured":"N. Ascheuer, S. O. Krumke, and J. Rambau. Online dial-a-ride problems: Minimizing the completion time. In Proceedings of the 17th International Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, 2000. To appear."},{"key":"11_CR2","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1137\/0217053","volume":"17","author":"M. J. Atallah","year":"1988","unstructured":"Mikhail J. Atallah and S. Rao Kosaraju. Efficient solutions to some transportation problems with applications to minimizing robot arm travel. SIAM Journal on Computing, 17:849\u2013869, 1988.","journal-title":"SIAM Journal on Computing"},{"key":"11_CR3","unstructured":"Georgio Ausiello, Esteban Feuerstein, Stefano Leonardi, Leen Stougie, and Maurizio Talamo. Algorithms for the on-line traveling salesman. Algorithmica, to appear."},{"key":"11_CR4","unstructured":"Allan Borodin and Ran El-Yaniv. Online Computation and Competitive Analysis. Cambridge University Press, 1998."},{"key":"11_CR5","unstructured":"Esteban Feuerstein and Leen Stougie. On-line single server dial-a-ride problems. Theoretical Computer Science, special issue on on-line algorithms, to appear."},{"key":"11_CR6","series-title":"Lect Notes Comput Sci","volume-title":"Online Algorithms: The State of the Art","year":"1998","unstructured":"Amos Fiat and Gerhard J. Woeginger, editors. Online Algorithms: The State of the Art, volume 1442 of Lecture Notes in Computer Science. Springer, 1998."},{"key":"11_CR7","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1006\/jagm.1993.1029","volume":"15","author":"G. N. Frederickson","year":"1993","unstructured":"Greg N. Frederickson and D. J. Guan. Nonpreemptive ensemble motion planning on a tree. Journal of Algorithms, 15:29\u201360, 1993.","journal-title":"Journal of Algorithms"},{"key":"11_CR8","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1137\/0207017","volume":"7","author":"G. N. Frederickson","year":"1978","unstructured":"Greg N. Frederickson, Matthew S. Hecht, and Chul Kim. Approximation algorithms for some routing problems. SIAM Journal on Computing, 7:178\u2013193, 1978.","journal-title":"SIAM Journal on Computing"},{"key":"11_CR9","unstructured":"Martin Gr\u00f6tschel, Dietrich Hauptmeier, Sven O. Krumke, and J\u00f6rg Rambau. Simulation studies for the online dial-a-ride-problem. Preprint SC 99-09, Konrad-Zuse-Zentrum f\u00fcr Informationstechnik Berlin, 1999."},{"key":"11_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/3-540-46784-X_6","volume-title":"Graph Theoretic Concepts in Computer Science","author":"D. Hauptmeier","year":"1999","unstructured":"Dietrich Hauptmeier, Sven O. Krumke, J\u00f6rg Rambau, and Hans C. Wirth. Euler is standing in line\u2014dial-a-ride problems with fifo-precedence-contraints. In Peter Widmeyer, Gabriele Neyer, and Stephan Eidenbenz, editors, Graph Theoretic Concepts in Computer Science, volume 1665 of Lecture Notes in Computer Science, pages 42\u201354. Springer, Berlin Heidelberg New York, 1999."},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Hans Kellerer, Thomas Tautenhahn, and Gerhard Woeginger. Approximability and nonapproximabiblity results for minimizing total flow time on a single machine. In Proceedings of the Symposium on the Theory of Computing, 1996.","DOI":"10.1145\/237814.237989"},{"key":"11_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0029570","volume-title":"Online Algorithms: The State of the Art","author":"J. Sgall","year":"1998","unstructured":"Ji\u0159\u00ed Sgall. Online scheduling. In Amos Fiat and Gerhard J. Woeginger, editors, Online Algorithms: The State of the Art, volume 1442 of Lecture Notes in Computer Science. Springer, 1998."},{"issue":"6","key":"11_CR13","doi-asserted-by":"publisher","first-page":"1313","DOI":"10.1137\/S0097539793248317","volume":"24","author":"D. B. Shmoys","year":"1995","unstructured":"David B. Shmoys, Joel Wein, and David 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","Algorithms and Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46521-9_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T00:44:37Z","timestamp":1556930677000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46521-9_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540671596","9783540465218"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-46521-9_11","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2000]]}}}