{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T23:00:35Z","timestamp":1743030035729,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030394783"},{"type":"electronic","value":"9783030394790"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-39479-0_9","type":"book-chapter","created":{"date-parts":[[2020,1,24]],"date-time":"2020-01-24T20:03:47Z","timestamp":1579896227000},"page":"120-137","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Managing Multiple Mobile Resources"],"prefix":"10.1007","author":[{"given":"Bj\u00f6rn","family":"Feldkord","sequence":"first","affiliation":[]},{"given":"Till","family":"Knollmann","sequence":"additional","affiliation":[]},{"given":"Manuel","family":"Malatyali","sequence":"additional","affiliation":[]},{"given":"Friedhelm","family":"Meyer auf der Heide","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,1,25]]},"reference":[{"issue":"5","key":"9_CR1","doi-asserted-by":"publisher","first-page":"40:1","DOI":"10.1145\/2783434","volume":"62","author":"N Bansal","year":"2015","unstructured":"Bansal, N., Buchbinder, N., Madry, A., Naor, J.: A polylogarithmic-competitive algorithm for the k-server problem. J. ACM 62(5), 40:1\u201340:49 (2015). \nhttps:\/\/doi.org\/10.1145\/2783434","journal-title":"J. ACM"},{"issue":"1","key":"9_CR2","doi-asserted-by":"publisher","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. Theor. Comput. Sci. 268(1), 43\u201366 (2001). \nhttps:\/\/doi.org\/10.1016\/S0304-3975(00)00259-0","journal-title":"Theor. Comput. Sci."},{"issue":"2\u20133","key":"9_CR3","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/j.tcs.2004.06.001","volume":"324","author":"Y Bartal","year":"2004","unstructured":"Bartal, Y., Koutsoupias, E.: On the competitive ratio of the work function algorithm for the k-server problem. Theor. Comput. Sci. 324(2\u20133), 337\u2013345 (2004). \nhttps:\/\/doi.org\/10.1016\/j.tcs.2004.06.001","journal-title":"Theor. Comput. Sci."},{"key":"9_CR4","doi-asserted-by":"publisher","unstructured":"Bienkowski, M., Byrka, J., Mucha, M.: Dynamic beats fixed: on phase-based algorithms for file migration. In: Proceedings of the 44th International Colloquium on Automata, Languages, and Programming (ICALP), pp. 13:1\u201313:14 (2017). \nhttps:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2017.13","DOI":"10.4230\/LIPIcs.ICALP.2017.13"},{"key":"9_CR5","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":"9_CR6","doi-asserted-by":"publisher","unstructured":"Bubeck, S., Cohen, M.B., Lee, Y.T., Lee, J.R., Madry, A.: k-server via multiscale entropic regularization. In: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing (STOC), pp. 3\u201316 (2018). \nhttps:\/\/doi.org\/10.1145\/3188745.3188798","DOI":"10.1145\/3188745.3188798"},{"issue":"2","key":"9_CR7","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1137\/0404017","volume":"4","author":"M Chrobak","year":"1991","unstructured":"Chrobak, M., Karloff, H.J., Payne, T.H., Vishwanathan, S.: New results on server problems. SIAM J. Discrete Math. 4(2), 172\u2013181 (1991). \nhttps:\/\/doi.org\/10.1137\/0404017","journal-title":"SIAM J. Discrete Math."},{"key":"9_CR8","doi-asserted-by":"publisher","unstructured":"Feldkord, B., der Heide, F.M.A.: The mobile server problem. In: Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 313\u2013319 (2017). \nhttps:\/\/doi.org\/10.1145\/3087556.3087575","DOI":"10.1145\/3087556.3087575"},{"key":"9_CR9","unstructured":"Feldkord, B., der Heide, F.M.A.: The mobile server problem. CoRR abs\/1904.05220 (2019). \nhttps:\/\/arxiv.org\/abs\/1904.05220"},{"issue":"4","key":"9_CR10","doi-asserted-by":"publisher","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). \nhttps:\/\/doi.org\/10.1016\/0196-6774(91)90041-V","journal-title":"J. Algorithms"},{"issue":"5","key":"9_CR11","doi-asserted-by":"publisher","first-page":"971","DOI":"10.1145\/210118.210128","volume":"42","author":"E Koutsoupias","year":"1995","unstructured":"Koutsoupias, E., Papadimitriou, C.H.: On the k-server conjecture. J. ACM 42(5), 971\u2013983 (1995). \nhttps:\/\/doi.org\/10.1145\/210118.210128","journal-title":"J. ACM"},{"key":"9_CR12","doi-asserted-by":"publisher","unstructured":"Lee, J.R.: Fusible HSTs and the randomized k-server conjecture. In: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, 7\u20139 October 2018, pp. 438\u2013449 (2018). \nhttps:\/\/doi.org\/10.1109\/FOCS.2018.00049","DOI":"10.1109\/FOCS.2018.00049"},{"issue":"2","key":"9_CR13","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1016\/0196-6774(90)90003-W","volume":"11","author":"MS Manasse","year":"1990","unstructured":"Manasse, M.S., McGeoch, L.A., Sleator, D.D.: Competitive algorithms for server problems. J. Algorithms 11(2), 208\u2013230 (1990). \nhttps:\/\/doi.org\/10.1016\/0196-6774(90)90003-W","journal-title":"J. Algorithms"},{"issue":"1","key":"9_CR14","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/s10100-011-0222-7","volume":"21","author":"T Rudec","year":"2013","unstructured":"Rudec, T., Baumgartner, A., Manger, R.: A fast work function algorithm for solving the k-server problem. CEJOR 21(1), 187\u2013205 (2013). \nhttps:\/\/doi.org\/10.1007\/s10100-011-0222-7","journal-title":"CEJOR"},{"issue":"3","key":"9_CR15","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1007\/s10100-014-0349-4","volume":"23","author":"T Rudec","year":"2015","unstructured":"Rudec, T., Manger, R.: A fast approximate implementation of the work function algorithm for solving the k-server problem. CEJOR 23(3), 699\u2013722 (2015). \nhttps:\/\/doi.org\/10.1007\/s10100-014-0349-4","journal-title":"CEJOR"},{"issue":"5","key":"9_CR16","doi-asserted-by":"publisher","first-page":"951","DOI":"10.1137\/S0097539791199796","volume":"23","author":"JR Westbrook","year":"1994","unstructured":"Westbrook, J.R.: Randomized algorithms for multiprocessor page migration. SIAM J. Comput. 23(5), 951\u2013965 (1994). \nhttps:\/\/doi.org\/10.1137\/S0097539791199796","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-39479-0_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,9]],"date-time":"2020-03-09T08:04:28Z","timestamp":1583741068000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-39479-0_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030394783","9783030394790"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-39479-0_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"25 January 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WAOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Approximation and Online Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Munich","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"waoa2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/algo2019.ak.in.tum.de\/index.php\/menue-waoa\/waoa-overview","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}