{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:22:06Z","timestamp":1725488526647},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540671411"},{"type":"electronic","value":"9783540465416"}],"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_50","type":"book-chapter","created":{"date-parts":[[2007,8,2]],"date-time":"2007-08-02T12:03:24Z","timestamp":1186056204000},"page":"605-613","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["On the Competitive Ratio of the Work Function Algorithm for the k-Server Problem"],"prefix":"10.1007","author":[{"given":"Yair","family":"Bartal","sequence":"first","affiliation":[]},{"given":"Elias","family":"Koutsoupias","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2000,3,24]]},"reference":[{"key":"50_CR1","unstructured":"Yair Bartal and Edward Grove. The Harmonic k-server algorithm is competitive. To appear in Journal of the ACM, 1999."},{"key":"50_CR2","unstructured":"Allan Borodin and Ran El-Yaniv. Online Computation and Competitive Analysis. Cambridge University Press, 1998."},{"key":"50_CR3","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1137\/0404017","volume":"4","author":"M. Chrobak","year":"1991","unstructured":"Marek Chrobak, Howard Karloff, Tom H. Payne, and Sundar Vishwanathan. New results on server problems. SIAM Journal on Discrete Mathematics, 4:172\u2013181, 1991.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"50_CR4","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1137\/0220008","volume":"20","author":"M. Chrobak","year":"1991","unstructured":"Marek Chrobak and Lawrence L. Larmore. An optimal online algorithm for k servers on trees. SIAM Journal on Computing, 20:144\u2013148, 1991.","journal-title":"SIAM Journal on Computing"},{"key":"50_CR5","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1090\/dimacs\/007\/02","volume":"7","author":"M. Chrobak","year":"1992","unstructured":"Marek Chrobak and Lawrence L. Larmore. The server problem and on-line games. In DIMACS Series in Discrete Mathematics and Theoretical Computer Science, volume 7, pages 11\u201364, 1992.","journal-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science"},{"key":"50_CR6","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1016\/S0022-0000(05)80060-1","volume":"48","author":"A. Fiat","year":"1994","unstructured":"Amos Fiat, Yuval Rabani, and Yiftach Ravid. Competitive k-server algorithms. Journal of Computer and System Sciences, 48:410\u2013428, 1994.","journal-title":"Journal of Computer and System Sciences"},{"key":"50_CR7","volume-title":"On-line algorithms and the k-server conjecture","author":"E. Koutsoupias","year":"1994","unstructured":"Elias Koutsoupias. On-line algorithms and the k-server conjecture. PhD thesis, University of California, San Diego, La Jolla, California, June 1994."},{"key":"50_CR8","unstructured":"Elias Koutsoupias. Weak adversaries for the k-server problem. In Proc 40th Symp. Foundations of Computer Science, 1999."},{"issue":"5","key":"50_CR9","doi-asserted-by":"publisher","first-page":"971","DOI":"10.1145\/210118.210128","volume":"42","author":"E. Koutsoupias","year":"1995","unstructured":"Elias Koutsoupias and Christos Papadimitriou. On the k-server conjecture. Journal of the ACM, 42(5):971\u2013983, September 1995.","journal-title":"Journal of the ACM"},{"issue":"5","key":"50_CR10","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/0020-0190(96)00010-5","volume":"57","author":"E. Koutsoupias","year":"1996","unstructured":"Elias Koutsoupias and Christos Papadimitriou. The 2-evader problem. Information Processing Letters, 57(5):249\u2013252, March 1996.","journal-title":"Information Processing Letters"},{"key":"50_CR11","doi-asserted-by":"crossref","unstructured":"Mark Manasse, Lyle A. McGeoch, and Daniel Sleator. Competitive algorithms for online problems. In Proc. 20th Symp. Theory of Computing, pages 322\u2013333, 1988.","DOI":"10.1145\/62212.62243"}],"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_50","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T09:49:52Z","timestamp":1558259392000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46541-3_50"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540671411","9783540465416"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-46541-3_50","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]},"assertion":[{"value":"24 March 2000","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}