{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T18:27:59Z","timestamp":1778783279679,"version":"3.51.4"},"reference-count":11,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2002,10,1]],"date-time":"2002-10-01T00:00:00Z","timestamp":1033430400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3942,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2002,10]]},"DOI":"10.1016\/s0304-3975(01)00305-x","type":"journal-article","created":{"date-parts":[[2002,10,7]],"date-time":"2002-10-07T20:25:18Z","timestamp":1034022318000},"page":"335-354","source":"Crossref","is-referenced-by-count":14,"title":["The 3-server problem in the plane"],"prefix":"10.1016","volume":"289","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":"78","reference":[{"key":"10.1016\/S0304-3975(01)00305-X_BIB1","series-title":"Online Computation and Competitive Analysis","author":"Borodin","year":"1998"},{"key":"10.1016\/S0304-3975(01)00305-X_BIB2","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1006\/jagm.1996.0024","article-title":"Traversing layered graphs using the work function algorithm","volume":"20","author":"Burley","year":"1996","journal-title":"J. Algorithms"},{"key":"10.1016\/S0304-3975(01)00305-X_BIB3","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1137\/0404017","article-title":"New results on server problems","volume":"4","author":"Chrobak","year":"1991","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0304-3975(01)00305-X_BIB4","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1137\/0220008","article-title":"An optimal online algorithm for k servers on trees","volume":"20","author":"Chrobak","year":"1991","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(01)00305-X_BIB5","doi-asserted-by":"crossref","unstructured":"M. Chrobak, L.L. Larmore, The server problem and on-line games, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 7, 1992, pp. 11\u201364.","DOI":"10.1090\/dimacs\/007\/02"},{"key":"10.1016\/S0304-3975(01)00305-X_BIB6","doi-asserted-by":"crossref","unstructured":"M. Chrobak, L.L. Larmore, Metrical task systems, the server problem, and the work function algorithm, Online Algorithms: State of the Art, Springer, Berlin, 1998, pp. 74\u201394.","DOI":"10.1007\/BFb0029565"},{"issue":"1","key":"10.1016\/S0304-3975(01)00305-X_BIB7","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1006\/jagm.1996.0853","article-title":"Page migration algorithms using work functions","volume":"24","author":"Chrobak","year":"1997","journal-title":"J. Algorithms"},{"key":"10.1016\/S0304-3975(01)00305-X_BIB8","doi-asserted-by":"crossref","unstructured":"E. Koutsoupias, C. Papadimitriou, On the k-server conjecture, Proc. 26th Symp. on Theory of Computing, 1994, pp. 507\u2013511.","DOI":"10.1145\/195058.195245"},{"key":"10.1016\/S0304-3975(01)00305-X_BIB9","doi-asserted-by":"crossref","first-page":"971","DOI":"10.1145\/210118.210128","article-title":"On the k-server conjecture","volume":"42","author":"Koutsoupias","year":"1995","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(01)00305-X_BIB10","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0020-0190(96)00010-5","article-title":"The 2-evader problem","volume":"57","author":"Koutsoupias","year":"1996","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0304-3975(01)00305-X_BIB11","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1016\/0196-6774(90)90003-W","article-title":"Competitive algorithms for server problems","volume":"11","author":"Manasse","year":"1990","journal-title":"J. Algorithms"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439750100305X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439750100305X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,9]],"date-time":"2020-03-09T17:54:57Z","timestamp":1583776497000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S030439750100305X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,10]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2002,10]]}},"alternative-id":["S030439750100305X"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(01)00305-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2002,10]]}}}