{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T07:21:26Z","timestamp":1777965686121,"version":"3.51.4"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319596464","type":"print"},{"value":"9783319596471","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-59647-1_18","type":"book-chapter","created":{"date-parts":[[2017,5,12]],"date-time":"2017-05-12T22:53:30Z","timestamp":1494629610000},"page":"231-247","source":"Crossref","is-referenced-by-count":4,"title":["Competitive Clustering of Stochastic Communication Patterns on a Ring"],"prefix":"10.1007","author":[{"given":"Chen","family":"Avin","sequence":"first","affiliation":[]},{"given":"Louis","family":"Cohen","sequence":"additional","affiliation":[]},{"given":"Stefan","family":"Schmid","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,14]]},"reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Adamaszek, A., Czumaj, A., Englert, M., R\u00e4cke, H.: An O(log k)-competitive algorithm for generalized caching. In: Proceedings of the 23rd SODA, pp. 1681\u20131689 (2012)","DOI":"10.1137\/1.9781611973099.133"},{"issue":"6","key":"18_CR2","doi-asserted-by":"crossref","first-page":"929","DOI":"10.1007\/s00224-006-1350-7","volume":"39","author":"K Andreev","year":"2006","unstructured":"Andreev, K., R\u00e4cke, H.: Balanced graph partitioning. Theor. Comput. Syst. 39(6), 929\u2013939 (2006)","journal-title":"Theor. Comput. Syst."},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Avin, C., Loukas, A., Pacut, M., Schmid, S.: Online balanced repartitioning. In: proceedings of the 30th International Symposium on Distributed Computing (DISC) (2016)","DOI":"10.1007\/978-3-662-53426-7_18"},{"issue":"1","key":"18_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). Also appeared in Proceedings of the 8th SODA, pp. 43\u201352 (1997)","journal-title":"Theoret. Comput. Sci."},{"key":"18_CR5","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1109\/TNET.2013.2245676","volume":"22","author":"M Bienkowski","year":"2014","unstructured":"Bienkowski, M., Feldmann, A., Grassler, J., Schaffrath, G., Schmid, S.: The wide-area virtual service migration problem: a competitive analysis approach. IEEE\/ACM Trans. Netw. (ToN) 22, 165\u2013178 (2014)","journal-title":"IEEE\/ACM Trans. Netw. (ToN)"},{"key":"18_CR6","unstructured":"Black, D.L., Sleator, D.D.: Competitive algorithms for replication and migration problems (1989)"},{"issue":"4","key":"18_CR7","doi-asserted-by":"crossref","first-page":"745","DOI":"10.1145\/146585.146588","volume":"39","author":"A Borodin","year":"1992","unstructured":"Borodin, A., Linial, N., Saks, M.E.: An optimal on-line algorithm for metrical task system. J. ACM 39(4), 745\u2013763 (1992). Also appeared in Proceedings of the 19th STOC, pp. 373\u2013382 (1987)","journal-title":"J. ACM"},{"issue":"2","key":"18_CR8","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/s00453-013-9793-0","volume":"71","author":"L Epstein","year":"2015","unstructured":"Epstein, L., Imreh, C., Levin, A., Nagy-Gy\u00f6rgy, J.: Online file caching with rejection penalties. Algorithmica 71(2), 279\u2013306 (2015)","journal-title":"Algorithmica"},{"issue":"4","key":"18_CR9","doi-asserted-by":"crossref","first-page":"1090","DOI":"10.1137\/S0097539701387660","volume":"31","author":"U Feige","year":"2002","unstructured":"Feige, U., Krauthgamer, R.: A polylogarithmic approximation of the minimum bisection. SIAM J. Comput. 31(4), 1090\u20131118 (2002)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"18_CR10","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1016\/0196-6774(91)90041-V","volume":"12","author":"A Fiat","year":"1991","unstructured":"Fiat, A., Karp, R.M., Luby, M., McGeoch, L.A., Sleator, D.D., Young, N.E.: Competitive paging algorithms. J. Algorithms 12(4), 685\u2013699 (1991)","journal-title":"J. Algorithms"},{"issue":"3","key":"18_CR11","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1016\/S0022-0000(05)80060-1","volume":"48","author":"A Fiat","year":"1994","unstructured":"Fiat, A., Rabani, Y., Ravid, Y.: Competitive k-server algorithms. J. Comput. Syst. Sci. 48(3), 410\u2013428 (1994)","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"18_CR12","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1137\/1007106","volume":"7","author":"W Franck","year":"1965","unstructured":"Franck, W.: An optimal search problem. SIAM Rev. 7(4), 503\u2013512 (1965)","journal-title":"SIAM Rev."},{"issue":"1","key":"18_CR13","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1137\/050640904","volume":"48","author":"R Krauthgamer","year":"2006","unstructured":"Krauthgamer, R., Feige, U.: A polylogarithmic approximation of the minimum bisection. SIAM Rev. 48(1), 99\u2013130 (2006)","journal-title":"SIAM Rev."},{"issue":"6","key":"18_CR14","doi-asserted-by":"crossref","first-page":"816","DOI":"10.1007\/BF01759073","volume":"6","author":"LA McGeoch","year":"1991","unstructured":"McGeoch, L.A., Sleator, D.D.: A strongly competitive randomized paging algorithm. Algorithmica 6(6), 816\u2013825 (1991)","journal-title":"Algorithmica"},{"issue":"2\u20133","key":"18_CR15","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/j.tcs.2004.05.015","volume":"324","author":"M Mendel","year":"2004","unstructured":"Mendel, M., Seiden, S.S.: Online companion caching. Theoret. Comput. Sci. 324(2\u20133), 183\u2013200 (2004)","journal-title":"Theoret. Comput. Sci."},{"key":"18_CR16","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511813603","volume-title":"Probability and Computing: Randomized Algorithms and Probabilistic Analysis","author":"M Mitzenmacher","year":"2005","unstructured":"Mitzenmacher, M., Upfal, E.: Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, New York (2005)"},{"issue":"5\u20136","key":"18_CR17","doi-asserted-by":"crossref","first-page":"1443","DOI":"10.1007\/BF02179880","volume":"80","author":"T P\u00f6schel","year":"1995","unstructured":"P\u00f6schel, T., Ebeling, W., Ros\u00e9, H.: Guessing probability distributions from small samples. J. Stat. Phys. 80(5\u20136), 1443\u20131452 (1995)","journal-title":"J. Stat. Phys."},{"issue":"3","key":"18_CR18","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0196-6774(89)90031-X","volume":"10","author":"PV Ramanan","year":"1989","unstructured":"Ramanan, P.V., Brown, D.J., Lee, C.C., Lee, D.T.: On-line bin packing in linear time. J. Algorithms 10(3), 305\u2013326 (1989)","journal-title":"J. Algorithms"},{"issue":"5","key":"18_CR19","doi-asserted-by":"crossref","first-page":"640","DOI":"10.1145\/585265.585269","volume":"49","author":"SS Seiden","year":"2002","unstructured":"Seiden, S.S.: On the online bin packing problem. J. ACM 49(5), 640\u2013671 (2002)","journal-title":"J. ACM"},{"issue":"2","key":"18_CR20","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"DD Sleator","year":"1985","unstructured":"Sleator, D.D., Tarjan, R.E.: Amortized efficiency of list update and paging rules. Commun. ACM 28(2), 202\u2013208 (1985)","journal-title":"Commun. ACM"},{"key":"18_CR21","doi-asserted-by":"crossref","unstructured":"Vaquero, L., Cuadrado, F., Logothetis, D., Martella, C.: Adaptive partitioning for large-scale dynamic graphs. In: Proceedings of the 4th Annual Symposium on Cloud Computing (SOCC), pp. 35:1\u201335:2 (2013)","DOI":"10.1145\/2523616.2525943"},{"key":"18_CR22","unstructured":"Young, N.E.: On-line caching as cache size varies. In: Proceedings of the 2nd ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 241\u2013250 (1991)"}],"container-title":["Lecture Notes in Computer Science","Networked Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-59647-1_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,24]],"date-time":"2019-09-24T11:58:03Z","timestamp":1569326283000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-59647-1_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319596464","9783319596471"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-59647-1_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}