{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:59:35Z","timestamp":1725893975946},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540735557"},{"type":"electronic","value":"9783540735564"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73556-4_10","type":"book-chapter","created":{"date-parts":[[2007,8,28]],"date-time":"2007-08-28T15:55:47Z","timestamp":1188316547000},"page":"72-80","source":"Crossref","is-referenced-by-count":1,"title":["On the On-Line k-Taxi Problem with Limited Look Ahead"],"prefix":"10.1007","author":[{"given":"Weimin","family":"Ma","sequence":"first","affiliation":[]},{"given":"Ting","family":"Gao","sequence":"additional","affiliation":[]},{"given":"Ke","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"D.D. Sleator","year":"1985","unstructured":"Sleator, D.D., Tarjan, R.E.: Amortized efficiency of list update and paging rules. Communication of the ACM\u00a028, 202\u2013208 (1985)","journal-title":"Communication of the ACM"},{"key":"10_CR2","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/BF01762111","volume":"3","author":"R. Karlin","year":"1988","unstructured":"Karlin, R., Manasse, M., Rudlph, L., Sleator, D.D.: Competitive snoopy caching. Algorithmica\u00a03, 79\u2013119 (1988)","journal-title":"Algorithmica"},{"key":"10_CR3","first-page":"322","volume-title":"Proc. 20th Annual ACM Symp. on Theory of Computing","author":"M.S. Manasse","year":"1988","unstructured":"Manasse, M.S., McGeoch, L.A., Sleator, D.D.: Competitive algorithms for on-line problems. In: Proc. 20th Annual ACM Symp. on Theory of Computing, pp. 322\u2013333. ACM Press, New York (1988)"},{"key":"10_CR4","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1145\/146585.146588","volume":"39","author":"A. Borodin","year":"1992","unstructured":"Borodin, A., Linial, N., Sake, M.: An optimal on-line algorithm for metrical task systems. Journal of ACM\u00a039, 745\u2013763 (1992)","journal-title":"Journal of ACM"},{"key":"10_CR5","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\u00a0(11), 208\u2013230 (1990)","journal-title":"Journal of Algorithms"},{"key":"10_CR6","first-page":"379","volume-title":"Proc. 22nd Annual ACM Symp. on Theory of Computing","author":"S. Ben-david","year":"1990","unstructured":"Ben-david, S., Borodin, A., Karp, R.M., ardos, G.T, Wigderson, A.: On the power if randomization in on-line algorithms. In: Proc. 22nd Annual ACM Symp. on Theory of Computing, pp. 379\u2013386. ACM Press, New York (1990)"},{"key":"10_CR7","doi-asserted-by":"publisher","first-page":"240","DOI":"10.2307\/2319522","volume":"81","author":"D.R. Woodall","year":"1974","unstructured":"Woodall, D.R.: The bay restaurant- a linear storage problem. American Mathematical Monthly\u00a081, 240\u2013246 (1974)","journal-title":"American Mathematical Monthly"},{"key":"10_CR8","first-page":"143","volume":"33","author":"H.A. Kierstead","year":"1981","unstructured":"Kierstead, H.A., Trotter, W.T.: An extremal problem in recursive combinatorics. Congressus Numerantium\u00a033, 143\u2013153 (1981)","journal-title":"Congressus Numerantium"},{"key":"10_CR9","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1145\/322186.322187","volume":"27","author":"A.C.C. Yao","year":"1980","unstructured":"Yao, A.C.C: New algorithm for bin packing. J. Assoc. Comput. Mach.\u00a027, 207\u2013227 (1980)","journal-title":"J. Assoc. Comput. Mach."},{"issue":"1-2","key":"10_CR10","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10107-003-0436-0","volume":"97","author":"S. Albers","year":"2003","unstructured":"Albers, S.: Online algorithms: a survey. Mathematical Programming\u00a097(1-2), 3\u201326 (2003)","journal-title":"Mathematical Programming"},{"key":"10_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0029561","volume-title":"Online algorithms: The state of the art","author":"A. Fiat","year":"1998","unstructured":"Fiat, A., Woeginger, G.J.: Online algorithms: The state of the art. LNCS, vol.\u00a01442. Springer, Heidelberg (1998)"},{"key":"10_CR12","unstructured":"Karp, R.: On-line algorithms versus offline algorithms: How Much is it Worth to Know the Future? In: Proc. IFIP 12th World Computer Congress, vol.\u00a01, pp. 416\u2013429 (1992)"},{"key":"10_CR13","doi-asserted-by":"crossref","unstructured":"Fleischer, R.: On the Bahncard Problem. In: Proc. TCS 2001, pp. 161\u2013174 (2001)","DOI":"10.1016\/S0304-3975(00)00266-8"},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"Karlin, A.R., Kenyon, C., Randall, D.: Dynamic TCP Acknowledgement and Other Stories about e\/(e\u2009\u2212\u20091). In: Proc. STOC 2001, pp. 502\u2013509 (2001)","DOI":"10.1145\/380752.380845"},{"key":"10_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"476","DOI":"10.1007\/3-540-36136-7_42","volume-title":"Algorithms and Computation","author":"H. Fujiwara","year":"2002","unstructured":"Fujiwara, H., Iwama, K.: Average-case Competitive Analyses for Ski-rental Problems. In: Bose, P., Morin, P. (eds.) ISAAC 2002. LNCS, vol.\u00a02518, pp. 476\u2013488. Springer, Heidelberg (2002)"},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"Xu, Y.F., Xu, W.J.: Competitive Algorithms for Online Leasing Problem in Probabilistic Environments. In: ISNN 2001, pp. 725\u2013730 (2004)","DOI":"10.1007\/978-3-540-28648-6_116"},{"issue":"1","key":"10_CR17","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"},{"issue":"1","key":"10_CR18","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1142\/S0129054104002340","volume":"15","author":"W.M. Ma","year":"2004","unstructured":"Ma, W.M., Xu, Y.F., You, J., Liu, J., Wang, K.L.: On the k-Truck Scheduling Problem. International Journal of Foundations of Computer Science\u00a015(1), 127\u2013141 (2004)","journal-title":"International Journal of Foundations of Computer Science"},{"issue":"4","key":"10_CR19","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1023\/A:1021253103047","volume":"24","author":"W.M. Ma","year":"2002","unstructured":"Ma, W.M., You, J., Xu, Y.F., Liu, J., Wang, K.L.: On the on-line number of snacks problem. Journal of Global Optimization\u00a024(4), 449\u2013462 (2002)","journal-title":"Journal of Global Optimization"},{"issue":"4","key":"10_CR20","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/s10898-005-2849-1","volume":"34","author":"W.M. Ma","year":"2006","unstructured":"Ma, W.M., Liu, J., Chen, G.Q., You, J.: Competitive analysis for the on-line truck transportation problem. Journal of global optimization\u00a034(4), 489\u2013502 (2006)","journal-title":"Journal of global optimization"},{"key":"10_CR21","first-page":"2","volume":"1","author":"Y.F. Xu","year":"1999","unstructured":"Xu, Y.F., Wang, K.L., Zhu, B.: On the k-taxi problem. Information\u00a01, 2\u20134 (1999)","journal-title":"Information"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73556-4_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T09:51:35Z","timestamp":1619517095000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73556-4_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540735557","9783540735564"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73556-4_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}