{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:41:46Z","timestamp":1725493306169},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540662518"},{"type":"electronic","value":"9783540484813"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"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":[[1999]]},"DOI":"10.1007\/3-540-48481-7_27","type":"book-chapter","created":{"date-parts":[[2007,10,27]],"date-time":"2007-10-27T19:49:40Z","timestamp":1193514580000},"page":"301-312","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["The 3-Server Problem in the Plane"],"prefix":"10.1007","author":[{"given":"Wolfgang W.","family":"Bein","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marek","family":"Chrobak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lawrence L.","family":"Larmore","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,1,14]]},"reference":[{"key":"27_CR1","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":"27_CR2","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":"27_CR3","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":"27_CR4","doi-asserted-by":"crossref","unstructured":"Marek Chrobak and Lawrence L. Larmore. Metrical task systems, the server problem, and the work function algorithm. In Online Algorithms: State of the Art, pages 74\u201394. Springer-Verlag, 1998.","DOI":"10.1007\/BFb0029565"},{"key":"27_CR5","doi-asserted-by":"crossref","unstructured":"Elias Koutsoupias and Christos Papadimitriou. On the k-server conjecture. In Proc. 26th Symp. Theory of Computing, pages 507\u2013511, 1994.","DOI":"10.1145\/195058.195245"},{"key":"27_CR6","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:971\u2013983, 1995.","journal-title":"Journal of the ACM"},{"key":"27_CR7","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:249\u2013252, 1996.","journal-title":"Information Processing Letters"},{"key":"27_CR8","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1016\/0196-6774(90)90003-W","volume":"11","author":"M. Manasse","year":"1990","unstructured":"Mark Manasse, Lyle A. McGeoch, and Daniel Sleator. Competitive algorithms for server problems. Journal of Algorithms, 11:208\u2013230, 1990.","journal-title":"Journal of Algorithms"}],"container-title":["Lecture Notes in Computer Science","Algorithms - ESA\u2019 99"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48481-7_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T22:12:30Z","timestamp":1578521550000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48481-7_27"}},"subtitle":["(Extended Abstract)"],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540662518","9783540484813"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-48481-7_27","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"14 January 2003","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}