{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,5]],"date-time":"2024-06-05T16:55:18Z","timestamp":1717606518024},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2013,10,17]],"date-time":"2013-10-17T00:00:00Z","timestamp":1381968000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2015,4]]},"DOI":"10.1007\/s00453-013-9841-9","type":"journal-article","created":{"date-parts":[[2013,10,16]],"date-time":"2013-10-16T15:34:05Z","timestamp":1381937645000},"page":"1035-1064","source":"Crossref","is-referenced-by-count":5,"title":["Asymptotically Optimal Online Page Migration on Three Points"],"prefix":"10.1007","volume":"71","author":[{"given":"Akira","family":"Matsubayashi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,10,17]]},"reference":[{"issue":"1","key":"9841_CR1","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1006\/jagm.1998.0924","volume":"28","author":"B. Awerbuch","year":"1998","unstructured":"Awerbuch, B., Bartal, Y., Fiat, A.: Distributed paging for general networks. J.\u00a0Algorithms 28(1), 67\u2013104 (1998)","journal-title":"J.\u00a0Algorithms"},{"issue":"1","key":"9841_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0890-5401(03)00055-5","volume":"185","author":"B. Awerbuch","year":"2003","unstructured":"Awerbuch, B., Bartal, Y., Fiat, A.: Competitive distributed file allocation. Inf. Comput. 185(1), 1\u201340 (2003)","journal-title":"Inf. Comput."},{"issue":"3","key":"9841_CR3","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1006\/jcss.1995.1073","volume":"51","author":"Y. Bartal","year":"1995","unstructured":"Bartal, Y., Fiat, A., Rabani, Y.: Competitive algorithms for distributed data management. J. Comput. Syst. Sci. 51(3), 341\u2013358 (1995)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"9841_CR4","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/S0304-3975(00)00259-0","volume":"268","author":"Y. Bartal","year":"2001","unstructured":"Bartal, Y., Charikar, M., Indyk, P.: On page migration and other relaxed task systems. Theoret. Comput. Sci. 268(1), 43\u201366 (2001)","journal-title":"Theoret. Comput. Sci."},{"key":"9841_CR5","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/S0304-3975(01)00305-X","volume":"289","author":"W.W. Bein","year":"2002","unstructured":"Bein, W.W., Chrobak, M., Larmore, L.L.: The 3-server problem in the plane. Theoret. Comput. Sci. 289, 335\u2013354 (2002)","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"9841_CR6","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/s00450-011-0150-8","volume":"27","author":"M. Bienkowski","year":"2012","unstructured":"Bienkowski, M.: Migrating and replicating data in networks. Comput. Sci. Res. Dev. 27(3), 169\u2013179 (2012)","journal-title":"Comput. Sci. Res. Dev."},{"issue":"4","key":"9841_CR7","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1016\/j.jda.2008.07.006","volume":"7","author":"M. Bienkowski","year":"2009","unstructured":"Bienkowski, M., Byrka, J., Korzeniowski, M., Meyer auf\u00a0der Heide, F.: Optimal algorithms for page migration in dynamic networks. J.\u00a0Discrete Algorithms 7(4), 545\u2013569 (2009)","journal-title":"J.\u00a0Discrete Algorithms"},{"key":"9841_CR8","unstructured":"Black, D.L., Sleator, D.D.: Competitive algorithms for replication and migration problems. Technical Report CMU-CS-89-201, Department of Computer Science, Carnegie Mellon University (1989)"},{"key":"9841_CR9","volume-title":"Online Computation and Competitive Analysis","author":"A. Borodin","year":"1998","unstructured":"Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)"},{"issue":"1","key":"9841_CR10","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1006\/jagm.1996.0853","volume":"24","author":"M. Chrobak","year":"1997","unstructured":"Chrobak, M., Larmore, L.L., Reingold, N., Westbrook, J.: Page migration algorithms using work functions. J.\u00a0Algorithms 24(1), 124\u2013157 (1997)","journal-title":"J.\u00a0Algorithms"},{"issue":"1","key":"9841_CR11","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/BF01762111","volume":"3","author":"A.R. Karlin","year":"1988","unstructured":"Karlin, A.R., Manasse, M.S., Rudolph, L., Sleator, D.D.: Competitive snoopy caching. Algorithmica 3(1), 79\u2013119 (1988)","journal-title":"Algorithmica"},{"issue":"5","key":"9841_CR12","first-page":"971","volume":"42","author":"E. Koutsoupias","year":"1995","unstructured":"Koutsoupias, E., Papadimitriou, C.H.: On the k-server conjecture. J.\u00a0ACM 42(5), 971\u2013983 (1995)","journal-title":"J.\u00a0ACM"},{"issue":"3","key":"9841_CR13","doi-asserted-by":"crossref","first-page":"1086","DOI":"10.1137\/S0097539795287824","volume":"28","author":"C. Lund","year":"1999","unstructured":"Lund, C., Reingold, N., Westbrook, J., Yan, D.: Competitive on-line algorithms for distributed data management. SIAM J.\u00a0Comput. 28(3), 1086\u20131111 (1999)","journal-title":"SIAM J.\u00a0Comput."},{"issue":"2","key":"9841_CR14","first-page":"161","volume":"42","author":"A. Matsubayashi","year":"2008","unstructured":"Matsubayashi, A.: Uniform page migration on general networks. Int. J. Pure Appl. Math. 42(2), 161\u2013168 (2008)","journal-title":"Int. J. Pure Appl. Math."},{"issue":"5","key":"9841_CR15","doi-asserted-by":"crossref","first-page":"951","DOI":"10.1137\/S0097539791199796","volume":"23","author":"J. Westbrook","year":"1994","unstructured":"Westbrook, J.: Randomized algorithms for multiprocessor page migration. SIAM J.\u00a0Comput. 23(5), 951\u2013965 (1994)","journal-title":"SIAM J.\u00a0Comput."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-013-9841-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-013-9841-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-013-9841-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:45:13Z","timestamp":1559123113000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-013-9841-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10,17]]},"references-count":15,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,4]]}},"alternative-id":["9841"],"URL":"https:\/\/doi.org\/10.1007\/s00453-013-9841-9","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,10,17]]}}}