{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,9]],"date-time":"2026-03-09T19:22:20Z","timestamp":1773084140798,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540262244","type":"print"},{"value":"9783540324409","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11496199_11","type":"book-chapter","created":{"date-parts":[[2010,7,14]],"date-time":"2010-07-14T10:29:15Z","timestamp":1279103355000},"page":"85-94","source":"Crossref","is-referenced-by-count":9,"title":["On the Online Dial-A-Ride Problem with Time-Windows"],"prefix":"10.1007","author":[{"given":"Fanglei","family":"Yi","sequence":"first","affiliation":[]},{"given":"Lei","family":"Tian","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"11_CR1","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1016\/0196-6774(90)90003-W","volume":"11","author":"M.S. Manasse","year":"1990","unstructured":"Manasse, M.S., McGeoch, L.A., Sleator, D.D.: Competitive algorithms for server problems. Journal of Algorithms\u00a011(2), 208\u2013230 (1990)","journal-title":"Journal of Algorithms"},{"issue":"1","key":"11_CR2","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/BF01294264","volume":"11","author":"S.B. David","year":"1994","unstructured":"David, S.B., Borodin, A.: A new measure for the study of the on-line algorithm. Algorithmica\u00a011(1), 73\u201391 (1994)","journal-title":"Algorithmica"},{"issue":"1","key":"11_CR3","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1137\/S0097539792224474","volume":"24","author":"N. Alon","year":"1995","unstructured":"Alon, N., Karp, R.M., Peleg, D., et al.: A graph-theoretic game and its application to the k- server problem. SIAM. J. Comput.\u00a024(1), 78\u2013100 (1995)","journal-title":"SIAM. J. Comput."},{"issue":"1","key":"11_CR4","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/S0304-3975(00)00261-9","volume":"268","author":"E. Feuerstein","year":"2001","unstructured":"Feuerstein, E., Stougie, L.: On-line single server dial-a-ride problems. Theoretical Computer Science\u00a0268(1), 91\u2013105 (2001)","journal-title":"Theoretical Computer Science"},{"key":"11_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/11775096_4","volume-title":"Algorithmic Aspects in Information and Management","author":"F. Yi","year":"2006","unstructured":"Ascheuer N., Krumke S.O., and Rambau J.: Online dial-a-ride problems: Minimizing the completion time. Lecture Notes in Computer Science. (2000) 639\u2013650"},{"issue":"1","key":"11_CR6","first-page":"56","volume":"31","author":"Y.F. Xu","year":"1997","unstructured":"Xu, Y.F., Wang, K.L.: Scheduling for on-line taxi problem and competitive algorithms. Journal of Xi\u2019an Jiao Tong University\u00a031(1), 56\u201361 (1997)","journal-title":"Journal of Xi\u2019an Jiao Tong University"},{"issue":"4","key":"11_CR7","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1007\/s004530010071","volume":"29","author":"G. Ausiello","year":"2001","unstructured":"Ausiello, G., Feuerstein, E., Leonardi, S., Stougie, L., Talamo, M.: Algorithms for the on-line traveling salesman. Algorithmica\u00a029(4), 560\u2013581 (2001)","journal-title":"Algorithmica"},{"key":"11_CR8","unstructured":"Irani, S., Lu, X., Regan, A.: On-line algorithms for the dynamic traveling repair problem. In: Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 517\u2013524 (2002)"},{"key":"11_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1007\/978-3-540-24592-6_15","volume-title":"Approximation and Online Algorithms","author":"S.O. Krumke","year":"2004","unstructured":"Krumke, S.O., Megow, N., Vredeveld, T.: How to whack moles. In: Solis-Oba, R., Jansen, K. (eds.) WAOA 2003. LNCS, vol.\u00a02909, pp. 192\u2013205. Springer, Heidelberg (2004)"},{"issue":"1","key":"11_CR10","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1023\/A:1017982528216","volume":"21","author":"W.M. Ma","year":"2001","unstructured":"Ma, W.M., Xu, Y.F., Wang, K.L.: On-line k-truck problem and its competitive algorithm. Journal of Global Optimization\u00a021(1), 15\u201325 (2001)","journal-title":"Journal of Global Optimization"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Hauptmeier, D., Krumke, S.O., Rambau, J.: The online dial-a-ride problem under reasonable load. In: LNCS, pp. 125\u2013136 (2000)","DOI":"10.1007\/3-540-46521-9_11"},{"key":"11_CR12","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/S0304-3975(02)00409-7","volume":"295","author":"S.O. Krumke","year":"2003","unstructured":"Krumke, S.O., de Paepe, W.E., Poensgen, D., Stougie, L.: News from the online traveling repairman. Theoretical Computer Science\u00a0295, 279\u2013294 (2003)","journal-title":"Theoretical Computer Science"},{"key":"11_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/3-540-45753-4_18","volume-title":"Approximation Algorithms for Combinatorial Optimization","author":"S.O. Krumke","year":"2002","unstructured":"Krumke, S.O., Laura, L., Lipmann, M., Marchetti-Spaccamela, A., de Paepe, W.E., Poensgen, D., Stougie, L.: Non-abusiveness helps: An \n                    \n                      \n                    \n                    $\\mathcal O(1)$\n                  -competitive algorithm for minimizing the maximum flow time in the online traveling salesman problem. In: Jansen, K., Leonardi, S., Vazirani, V.V. (eds.) APPROX 2002. LNCS, vol.\u00a02462, pp. 200\u2013214. Springer, Heidelberg (2002)"},{"key":"11_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"674","DOI":"10.1007\/3-540-45749-6_59","volume-title":"Algorithms - ESA 2002","author":"M. Lipmann","year":"2002","unstructured":"Lipmann, M., Lu, X., de Paepe, W.E., Sitters, R.A.: On-Line Dial-a-Ride Problems under a Restricted Information Model. In: M\u00f6hring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol.\u00a02461, pp. 674\u2013685. Springer, Heidelberg (2002)"},{"key":"11_CR15","first-page":"429","volume":"2","author":"Y.F. Xu","year":"1999","unstructured":"Xu, Y.F., Wang, K.L., Zhu, B.: On the k-taxi problem. Journal of Information\u00a02, 429\u2013434 (1999)","journal-title":"Journal of Information"},{"key":"11_CR16","unstructured":"Xu, Y.F., Wang, K.L., Ding, J.H.: On-line k-taxi scheduling on a constrained graph and its competitive algorithm. Journal of System Engineering(P.R. China)\u00a04 (1999)"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Applications in Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11496199_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:39:50Z","timestamp":1619505590000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11496199_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540262244","9783540324409"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11496199_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}