{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:11:20Z","timestamp":1725484280890},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540439967"},{"type":"electronic","value":"9783540456551"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45655-4_54","type":"book-chapter","created":{"date-parts":[[2007,5,21]],"date-time":"2007-05-21T11:37:01Z","timestamp":1179747421000},"page":"504-513","source":"Crossref","is-referenced-by-count":0,"title":["New Results on the k-Truck Problem"],"prefix":"10.1007","author":[{"given":"Weimin","family":"Ma","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yinfeng","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jane","family":"You","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"James","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kanliang","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,8,29]]},"reference":[{"issue":"1","key":"54_CR1","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1023\/A:1017982528216","volume":"21","author":"W.M. Ma","year":"2001","unstructured":"W.M. Ma, Y.F. Xu, and K.L. Wang, On-line k-truck problem and its competitive algorithm. Journal of Global Optimization 21(1): 15\u201325, September 2001.","journal-title":"Journal of Global Optimization"},{"issue":"3es","key":"54_CR2","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1145\/333580.333583","volume":"31","author":"Susanne Albers","year":"1999","unstructured":"S. Albers and S. Leonardi. Online algorithms. ACM Computing Surveys Vol.31. Issue 3 Sept. 1999.","journal-title":"ACM Computing Surveys"},{"key":"54_CR3","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"D.D. Sleator","year":"1985","unstructured":"D.D. Sleator, R.E. Tarjan, Amortized efficiency of list update and paging rules, Communication of the ACM, 28 (1985) 202\u2013208.","journal-title":"Communication of the ACM"},{"key":"54_CR4","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/BF01762111","volume":"3","author":"A. Karlin","year":"1988","unstructured":"A. Karlin, M. Manasse, L. Rudlph and D.D. Sleator. Competitive snoopy caching, Algorithmica, 3:79\u2013119, 1988.","journal-title":"Algorithmica"},{"key":"54_CR5","doi-asserted-by":"crossref","unstructured":"M.S. Manasse, L.A. McGeoch, and D.D. Sleator, Competitive algorithms for on-line problems. In Proc. 20th Annual ACM Symp. on Theory of Computing, 322\u201333, 1988.","DOI":"10.1145\/62212.62243"},{"issue":"2","key":"54_CR6","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1016\/0196-6774(90)90003-W","volume":"11","author":"Mark S Manasse","year":"1990","unstructured":"M.S. Manasse, L.A. McGeoch, and D.D. Sleator, Competitive algorithms for server problems, Journal of Algorithms, 1990(11), 208\u2013230.","journal-title":"Journal of Algorithms"},{"key":"54_CR7","doi-asserted-by":"crossref","unstructured":"S. Ben-David, S. Borodin, R.M. Karp, G. Tardos, and A. Wigderson. On the power if randomization in on-line algorithms. In Proc. 22nd Annual ACM Symp. on Theory of Computing, 379\u2013386, 1990.","DOI":"10.1145\/100216.100268"},{"key":"54_CR8","unstructured":"Y.F. Xu, K.L. Wang, and B. Zhu, On the k-taxi problem, Information, Vol.2, No.4, 1999."},{"key":"54_CR9","doi-asserted-by":"crossref","unstructured":"E. Koutsoupias, C. Papadimitriou, On the k-server conjecture, STOC., 507\u2013511, 1994.","DOI":"10.1145\/195058.195245"},{"key":"54_CR10","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1137\/0220008","volume":"20","author":"M. Chrobak","year":"1991","unstructured":"M. Chrobak, L. Larmore, An optimal algorithm for the server problem on trees, SIAM Journal of Computing 20 (1991)144\u2013148.","journal-title":"SIAM Journal of Computing"},{"key":"54_CR11","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1137\/0404017","volume":"4","author":"M. Chrobak","year":"1991","unstructured":"M. Chrobak, H. Karloff, T. Payne, S. Vishwanathan, New results on the server problem, SIAM Journal on Discrete Mathematics 4 (1991) 172\u2013181.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"54_CR12","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1137\/1.9781611970265","volume-title":"Data Structures and Network Algorithms","author":"R. Tarjan","year":"1983","unstructured":"R. Tarjan, Data Structures and Network Algorithms, SIAM, Philadelphia, 1983, 109\u2013111."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45655-4_54","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T06:27:22Z","timestamp":1556432842000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45655-4_54"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540439967","9783540456551"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-45655-4_54","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}