{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T03:54:30Z","timestamp":1725854070903},"publisher-location":"New York, NY","reference-count":15,"publisher":"Springer New York","isbn-type":[{"type":"print","value":"9781493928637"},{"type":"electronic","value":"9781493928644"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-1-4939-2864-4_484","type":"book-chapter","created":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T15:07:11Z","timestamp":1553094431000},"page":"2378-2380","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Work-Function Algorithm for k-Servers"],"prefix":"10.1007","author":[{"given":"Marek","family":"Chrobak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,4,22]]},"reference":[{"key":"472_CR23120","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1016\/S0304-3975(01)00253-5","volume":"287","author":"EJ Anderson","year":"2002","unstructured":"Anderson EJ, Hildrum K, Karlin AR, Rasala A, Saks M (2002) On list update and work function algorithms. Theor Comput Sci 287:393\u2013418","journal-title":"Theor Comput Sci"},{"key":"472_CR23121","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1016\/S0304-3975(01)00252-3","volume":"287","author":"W Bein","year":"2002","unstructured":"Bein W, Chrobak M, Larmore LL (2002) The 3-server problem in the plane. Theor Comput Sci 287:387\u2013391","journal-title":"Theor Comput Sci"},{"key":"472_CR23122","volume-title":"Online computation and competitive analysis","author":"A Borodin","year":"1998","unstructured":"Borodin A, El-Yaniv R (1998) Online computation and competitive analysis. Cambridge University Press, Cambridge"},{"key":"472_CR23123","first-page":"373","volume-title":"Proceedings of the 19th symposium on theory of computing (STOC)","author":"A Borodin","year":"1987","unstructured":"Borodin A, Linial N, Saks M (1987) An optimal online algorithm for metrical task systems. In: Proceedings of the 19th symposium on theory of computing (STOC). ACM, New York, pp\u00a0373\u2013382"},{"key":"472_CR23124","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1006\/jagm.1996.0024","volume":"20","author":"WR Burley","year":"1996","unstructured":"Burley WR (1996) Traversing layered graphs using the work function algorithm. J Algorithms 20:479\u2013511","journal-title":"J Algorithms"},{"key":"472_CR23125","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1145\/1324215.1324233","volume":"38","author":"M Chrobak","year":"2007","unstructured":"Chrobak M (2007) Competitiveness via primal-dual. SIGACT News 38:100\u2013105","journal-title":"SIGACT News"},{"key":"472_CR23126","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1137\/0220008","volume":"20","author":"M Chrobak","year":"1991","unstructured":"Chrobak M, Larmore LL (1991) An optimal online algorithm for k servers on trees. SIAM J Comput 20:144\u2013148","journal-title":"SIAM J Comput"},{"key":"472_CR23127","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/BFb0029565","volume-title":"Online algorithms: the state of the art","author":"M Chrobak","year":"1998","unstructured":"Chrobak M, Larmore LL (1998) Metrical task systems, the server problem, and the work function algorithm. In: Fiat A, Woeginger GJ (eds) Online algorithms: the state of the art. Springer, Berlin\/New York, pp\u00a074\u201394"},{"key":"472_CR23128","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1137\/0404017","volume":"4","author":"M Chrobak","year":"1991","unstructured":"Chrobak M, Karloff H, Payne TH, Vishwanathan S (1991) New results on server problems. SIAM J Discret Math 4:172\u2013181","journal-title":"SIAM J Discret Math"},{"key":"472_CR23129","first-page":"444","volume-title":"Proceedings of the 40th symposium on foundations of computer science (FOCS)","author":"E Koutsoupias","year":"1999","unstructured":"Koutsoupias E (1999) Weak adversaries for the k-server problem. In: Proceedings of the 40th symposium on foundations of computer science (FOCS). IEEE, New York, pp\u00a0444\u2013449"},{"key":"472_CR23130","first-page":"507","volume-title":"Proceedings of the 26th symposium on theory of computing (STOC)","author":"E Koutsoupias","year":"1994","unstructured":"Koutsoupias E, Papadimitriou C (1994) On the k-server conjecture. In: Proceedings of the 26th symposium on theory of computing (STOC). ACM, Montreal, pp\u00a0507\u2013511"},{"key":"472_CR23131","doi-asserted-by":"publisher","first-page":"971","DOI":"10.1145\/210118.210128","volume":"42","author":"E Koutsoupias","year":"1995","unstructured":"Koutsoupias E, Papadimitriou C (1995) On the k-server conjecture. J ACM 42:971\u2013983","journal-title":"J ACM"},{"key":"472_CR23132","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/0020-0190(96)00010-5","volume":"57","author":"E Koutsoupias","year":"1996","unstructured":"Koutsoupias E, Papadimitriou C (1996) The 2-evader problem. Inf Process Lett 57:249\u2013252","journal-title":"Inf Process Lett"},{"key":"472_CR23133","first-page":"322","volume-title":"Proceedings of the 20th symposium on theory of computing (STOC)","author":"M Manasse","year":"1988","unstructured":"Manasse M, McGeoch LA, Sleator D (1988) Competitive algorithms for online problems. In: Proceedings of the 20th symposium on theory of computing (STOC). ACM, Chicago, pp\u00a0322\u2013333"},{"key":"472_CR23134","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1016\/0196-6774(90)90003-W","volume":"11","author":"M Manasse","year":"1990","unstructured":"Manasse M, McGeoch LA, Sleator D (1990) Competitive algorithms for server problems. J Algorithms 11:208\u2013230","journal-title":"J Algorithms"}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4939-2864-4_484","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T15:36:47Z","timestamp":1553096207000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-4939-2864-4_484"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9781493928637","9781493928644"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-1-4939-2864-4_484","relation":{},"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}