{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:15:13Z","timestamp":1759335313831,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031598340"},{"type":"electronic","value":"9783031598357"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-59835-7_14","type":"book-chapter","created":{"date-parts":[[2024,5,21]],"date-time":"2024-05-21T07:05:03Z","timestamp":1716275103000},"page":"182-195","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Fully-Dynamic Load Balancing"],"prefix":"10.1007","author":[{"given":"Ayoub","family":"Foussoul","sequence":"first","affiliation":[]},{"given":"Vineet","family":"Goyal","sequence":"additional","affiliation":[]},{"given":"Amit","family":"Kumar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,5,22]]},"reference":[{"key":"14_CR1","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/PL00009263","volume":"23","author":"M Andrews","year":"1999","unstructured":"Andrews, M., Goemans, M.X., Zhang, L.: Improved bounds for on-line load balancing. Algorithmica 23, 278\u2013301 (1999)","journal-title":"Algorithmica"},{"issue":"1","key":"14_CR2","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0304-3975(94)90153-8","volume":"130","author":"Y Azar","year":"1994","unstructured":"Azar, Y., Broder, A.Z., Karlin, A.R.: On-line load balancing. Theoret. Comput. Sci. 130(1), 73\u201384 (1994)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"14_CR3","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1006\/jagm.1995.0799","volume":"22","author":"Y Azar","year":"1997","unstructured":"Azar, Y., Kalyanasundaram, B., Plotkin, S., Pruhs, K.R., Waarts, O.: On-line load balancing of temporary tasks. J. Algorithms 22(1), 93\u2013110 (1997)","journal-title":"J. Algorithms"},{"issue":"2","key":"14_CR4","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1006\/jagm.1995.1008","volume":"18","author":"Y Azar","year":"1995","unstructured":"Azar, Y., Naor, J., Rom, R.: The competitiveness of on-line assignments. J. Algorithms 18(2), 221\u2013237 (1995)","journal-title":"J. Algorithms"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"Bhattacharya, S., Buchbinder, N., Levin, R., Saranurak, T.: Chasing positive bodies. In: 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS), pp. 1694\u20131714 (2023)","DOI":"10.1109\/FOCS57990.2023.00103"},{"key":"14_CR6","unstructured":"Bosek, B., Zych-Pawlewicz, A.: Dynamic coloring of unit interval graphs with limited recourse budget. In: 30th Annual European Symposium on Algorithms (ESA 2022), vol.\u00a0244, pp. 1\u201314 (2022)"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Brodal, G.S., Fagerberg, R.: Dynamic representations of sparse graphs. In: Workshop on Algorithms and Data Structures, pp. 342\u2013351 (1999)","DOI":"10.1007\/3-540-48447-7_34"},{"key":"14_CR8","unstructured":"Feldkord, B., et al.: Fully-dynamic bin packing with little repacking. In: 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018), vol.\u00a0107, pp. 1\u201324 (2018)"},{"issue":"6","key":"14_CR9","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1002\/1099-1425(200011\/12)3:6<343::AID-JOS54>3.0.CO;2-2","volume":"3","author":"R Fleischer","year":"2000","unstructured":"Fleischer, R., Wahl, M.: On-line scheduling revisited. J. Sched. 3(6), 343\u2013353 (2000)","journal-title":"J. Sched."},{"key":"14_CR10","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/s13676-014-0053-5","volume":"5","author":"C Fricker","year":"2016","unstructured":"Fricker, C., Gast, N.: Incentives and redistribution in homogeneous bike-sharing systems with stations of finite capacity. Euro J. Transp. Logist. 5, 261\u2013291 (2016)","journal-title":"Euro J. Transp. Logist."},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Grove, E.F., Kao, M.Y., Krishnan, P., Vitter, J.S.: Online perfect matching and mobile computing. In: Algorithms and Data Structures: 4th International Workshop, WADS\u201995, pp. 194\u2013205 (1995)","DOI":"10.1007\/3-540-60220-8_62"},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Gu, A., Gupta, A., Kumar, A.: The power of deferral: maintaining a constant-competitive steiner tree online. In: Proceedings of the Forty-Fifth Annual ACM Symposium on Theory of Computing, pp. 525\u2013534 (2013)","DOI":"10.1145\/2488608.2488674"},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"Gupta, A., Krishnaswamy, R., Kumar, A., Panigrahi, D.: Online and dynamic algorithms for set cover. In: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, pp. 537\u2013550 (2017)","DOI":"10.1145\/3055399.3055493"},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"Gupta, A., Kumar, A., Stein, C.: Maintaining assignments online: matching, scheduling, and flows. In: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, pp. 468\u2013479 (2014)","DOI":"10.1137\/1.9781611973402.35"},{"issue":"3","key":"14_CR15","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1137\/0404033","volume":"4","author":"M Imase","year":"1991","unstructured":"Imase, M., Waxman, B.M.: Dynamic Steiner tree problem. SIAM J. Discret. Math. 4(3), 369\u2013384 (1991)","journal-title":"SIAM J. Discret. Math."},{"key":"14_CR16","doi-asserted-by":"crossref","unstructured":"Krishnaswamy, R., Li, S., Suriyanarayana, V.: Online unrelated-machine load balancing and generalized flow with recourse. In: Proceedings of the 55th Annual ACM Symposium on Theory of Computing, pp. 775\u2013788 (2023)","DOI":"10.1145\/3564246.3585222"},{"issue":"3","key":"14_CR17","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1137\/130917703","volume":"45","author":"N Megow","year":"2016","unstructured":"Megow, N., Skutella, M., Verschae, J., Wiese, A.: The power of recourse for online MST and TSP. SIAM J. Comput. 45(3), 859\u2013880 (2016)","journal-title":"SIAM J. Comput."},{"key":"14_CR18","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/PL00009214","volume":"21","author":"S Phillips","year":"1998","unstructured":"Phillips, S., Westbrook, J.: On-line load balancing and network flow. Algorithmica 21, 245\u2013261 (1998)","journal-title":"Algorithmica"},{"issue":"3","key":"14_CR19","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1137\/S0097539702403438","volume":"32","author":"JF Rudin III","year":"2003","unstructured":"Rudin, J.F., III., Chandrasekaran, R.: Improved bounds for the online scheduling problem. SIAM J. Comput. 32(3), 717\u2013735 (2003)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"14_CR20","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1287\/moor.1090.0381","volume":"34","author":"P Sanders","year":"2009","unstructured":"Sanders, P., Sivadasan, N., Skutella, M.: Online scheduling with bounded migration. Math. Oper. Res. 34(2), 481\u2013498 (2009)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"14_CR21","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1109\/TNET.2014.2362745","volume":"24","author":"W Wang","year":"2014","unstructured":"Wang, W., Zhu, K., Ying, L., Tan, J., Zhang, L.: MapTask scheduling in MapReduce with data locality: throughput and heavy-traffic optimality. IEEE\/ACM Trans. Networking 24(1), 190\u2013203 (2014)","journal-title":"IEEE\/ACM Trans. Networking"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-59835-7_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,21]],"date-time":"2024-05-21T07:13:12Z","timestamp":1716275592000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-59835-7_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031598340","9783031598357"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-59835-7_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"22 May 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IPCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integer Programming and Combinatorial Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Wroc\u0142aw","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 July 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ipco2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ipco2024.ii.uni.wroc.pl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}