{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T13:04:06Z","timestamp":1648559046445},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2013,5,16]],"date-time":"2013-05-16T00:00:00Z","timestamp":1368662400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2015,5]]},"DOI":"10.1007\/s10878-013-9621-0","type":"journal-article","created":{"date-parts":[[2013,5,15]],"date-time":"2013-05-15T11:59:58Z","timestamp":1368619198000},"page":"836-846","source":"Crossref","is-referenced-by-count":3,"title":["The online $$k$$ k -server problem with max-distance objective"],"prefix":"10.1007","volume":"29","author":[{"given":"Yinfeng","family":"Xu","sequence":"first","affiliation":[]},{"given":"Hongmei","family":"Li","sequence":"additional","affiliation":[]},{"given":"Changzheng","family":"He","sequence":"additional","affiliation":[]},{"given":"Li","family":"Luo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,5,16]]},"reference":[{"key":"9621_CR1","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1016\/j.tcs.2004.06.001","volume":"324","author":"Y Bartal","year":"2004","unstructured":"Bartal Y, Koutsoupias E (2004) On the competitive ratio of the work function algorithm for the $$k$$ k -server problem. Theor Comput Sci 324:337\u2013345","journal-title":"Theor Comput Sci"},{"key":"9621_CR2","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/S0304-3975(01)00305-X","volume":"289","author":"WW Bein","year":"2002","unstructured":"Bein WW, Chrobak M, Larmore LL (2002) The 3-server problem in the plane. Theor Comput Sci 289: 335\u2013354","journal-title":"Theor Comput Sci"},{"key":"9621_CR3","volume-title":"Online computation and competitive analysis","author":"A Borodin","year":"1998","unstructured":"Borodin A, EI-Yaniv R (1998) Online computation and competitive analysis. Cambridge University Press, Cambridge"},{"key":"9621_CR4","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1137\/0220008","volume":"20","author":"M Chrobak","year":"1991","unstructured":"Chrobak M, Larmore LL (1991) An optimal on-line algorithm for $$k$$ k severs on trees. SIAM J Comput 20:144\u2013148","journal-title":"SIAM J Comput"},{"key":"9621_CR5","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1090\/dimacs\/007\/02","volume":"7","author":"M Chrobak","year":"1992","unstructured":"Chrobak M, Larmore LL (1992) The server problem and on-line games. DIMAGS Ser Discrete Math Theor Comput Sci 7:11\u201364","journal-title":"DIMAGS Ser Discrete Math Theor Comput Sci"},{"key":"9621_CR6","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1137\/0404017","volume":"4","author":"M Chrobak","year":"1991","unstructured":"Chrobak M, Karloff J, Payne TH, Vishwanathan S (1991) New results on server problems. SIAM J Discrete Math 4:172\u2013181","journal-title":"SIAM J Discrete Math"},{"key":"9621_CR7","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0020-0190(94)90138-4","volume":"52","author":"MJ Kleinberg","year":"1990","unstructured":"Kleinberg MJ (1990) A lower bound for two-server balancing algorithms. Inf Process Lett 52:39\u201343","journal-title":"Inf Process Lett"},{"key":"9621_CR8","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/j.cosrev.2009.04.002","volume":"3","author":"E Koutsoupias","year":"2009","unstructured":"Koutsoupias E (2009) The $$k$$ k -server problem. Comput Sci Rev 3:105\u2013118","journal-title":"Comput Sci Rev"},{"key":"9621_CR9","doi-asserted-by":"crossref","unstructured":"Koutsoupias E, Papadimitriou C (1994) On the $$k$$ k -server conjecture. In: Proceedings of the 26th Symposium on Theory of Computing, STOC, ACM, pp 507\u2013511","DOI":"10.1145\/195058.195245"},{"key":"9621_CR10","doi-asserted-by":"crossref","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":"9621_CR11","unstructured":"Lipmann M (2003) Online routing. Technische Universiteit Eindhoven, Eindhoven"},{"key":"9621_CR12","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1016\/0196-6774(90)90003-W","volume":"11","author":"SM Manasse","year":"1990","unstructured":"Manasse SM, McGeoch AL, Sleator DD (1990) Competitive algorithms for server problems. J Algorithms 11:208\u2013230","journal-title":"J Algorithms"},{"key":"9621_CR13","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"DD Sleator","year":"1985","unstructured":"Sleator DD, Tarjan ER (1985) Amortized efficiency of list update and paging rules. Commun ACM 28: 202\u2013208","journal-title":"Commun ACM"},{"key":"9621_CR14","doi-asserted-by":"crossref","first-page":"470","DOI":"10.1007\/s00224-008-9103-4","volume":"45","author":"B Vinvenzo","year":"2009","unstructured":"Vinvenzo B, Leen S (2009) Online $$k$$ k -server routing problems. Theory Comput Syst 45:470\u2013485","journal-title":"Theory Comput Syst"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9621-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-013-9621-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9621-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,13]],"date-time":"2019-07-13T20:58:58Z","timestamp":1563051538000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-013-9621-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,5,16]]},"references-count":14,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,5]]}},"alternative-id":["9621"],"URL":"https:\/\/doi.org\/10.1007\/s10878-013-9621-0","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,5,16]]}}}