{"user_id":"14052","citation":{"ieee":"B. Feldkord <i>et al.</i>, “Fully-Dynamic Bin Packing with Little Repacking,” in <i>45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)</i>, Prag, 2018, vol. 107, pp. 51:1-51:24.","apa":"Feldkord, B., Feldotto, M., Gupta, A., Guruganesh, G., Kumar, A., Riechers, S., &#38; Wajc, D. (2018). Fully-Dynamic Bin Packing with Little Repacking. In I. Chatzigiannakis, C. Kaklamanis, D. Marx, &#38; D. Sannella (Eds.), <i>45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)</i> (Vol. 107, pp. 51:1-51:24). Dagstuhl, Germany: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2018.51\">https://doi.org/10.4230/LIPIcs.ICALP.2018.51</a>","mla":"Feldkord, Björn, et al. “Fully-Dynamic Bin Packing with Little Repacking.” <i>45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)</i>, edited by Ioannis Chatzigiannakis et al., vol. 107, Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2018, pp. 51:1-51:24, doi:<a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2018.51\">10.4230/LIPIcs.ICALP.2018.51</a>.","bibtex":"@inproceedings{Feldkord_Feldotto_Gupta_Guruganesh_Kumar_Riechers_Wajc_2018, place={Dagstuhl, Germany}, series={Leibniz International Proceedings in Informatics (LIPIcs)}, title={Fully-Dynamic Bin Packing with Little Repacking}, volume={107}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2018.51\">10.4230/LIPIcs.ICALP.2018.51</a>}, booktitle={45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, publisher={Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik}, author={Feldkord, Björn and Feldotto, Matthias and Gupta, Anupam and Guruganesh, Guru and Kumar, Amit  and Riechers, Sören and Wajc, David}, editor={Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, Dániel and Sannella, DonaldEditors}, year={2018}, pages={51:1-51:24}, collection={Leibniz International Proceedings in Informatics (LIPIcs)} }","chicago":"Feldkord, Björn, Matthias Feldotto, Anupam Gupta, Guru Guruganesh, Amit  Kumar, Sören Riechers, and David Wajc. “Fully-Dynamic Bin Packing with Little Repacking.” In <i>45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)</i>, edited by Ioannis Chatzigiannakis, Christos Kaklamanis, Dániel Marx, and Donald Sannella, 107:51:1-51:24. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2018. <a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2018.51\">https://doi.org/10.4230/LIPIcs.ICALP.2018.51</a>.","ama":"Feldkord B, Feldotto M, Gupta A, et al. Fully-Dynamic Bin Packing with Little Repacking. In: Chatzigiannakis I, Kaklamanis C, Marx D, Sannella D, eds. <i>45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)</i>. Vol 107. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik; 2018:51:1-51:24. doi:<a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2018.51\">10.4230/LIPIcs.ICALP.2018.51</a>","short":"B. Feldkord, M. Feldotto, A. Gupta, G. Guruganesh, A. Kumar, S. Riechers, D. Wajc, in: I. Chatzigiannakis, C. Kaklamanis, D. Marx, D. Sannella (Eds.), 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018), Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 2018, pp. 51:1-51:24."},"publisher":"Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik","department":[{"_id":"541"},{"_id":"63"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Subproject A1","_id":"5"},{"_id":"7","name":"SFB 901 - Subproject A3"},{"_id":"16","name":"SFB 901 - Subproject C4"}],"series_title":"Leibniz International Proceedings in Informatics (LIPIcs)","editor":[{"first_name":"Ioannis","full_name":"Chatzigiannakis, Ioannis","last_name":"Chatzigiannakis"},{"last_name":"Kaklamanis","full_name":"Kaklamanis, Christos","first_name":"Christos"},{"last_name":"Marx","full_name":"Marx, Dániel","first_name":"Dániel"},{"full_name":"Sannella, Donald","last_name":"Sannella","first_name":"Donald"}],"language":[{"iso":"eng"}],"has_accepted_license":"1","date_updated":"2022-01-06T06:56:39Z","publication_status":"published","title":"Fully-Dynamic Bin Packing with Little Repacking","external_id":{"arxiv":["1711.01231"]},"place":"Dagstuhl, Germany","file":[{"file_id":"5227","access_level":"closed","success":1,"date_created":"2018-10-31T16:58:18Z","content_type":"application/pdf","relation":"main_file","file_name":"LIPIcs-ICALP-2018-51.pdf","creator":"feldi","date_updated":"2018-10-31T16:58:18Z","file_size":723824}],"volume":107,"abstract":[{"lang":"eng","text":"We study the classic bin packing problem in a fully-dynamic setting, where new items can arrive and old items may depart. We want algorithms with low asymptotic competitive ratio while repacking items sparingly between updates. Formally, each item i has a movement cost c_i >= 0, and we want to use alpha * OPT bins and incur a movement cost gamma * c_i, either in the worst case, or in an amortized sense, for alpha, gamma as small as possible. We call gamma the recourse of the algorithm. This is motivated by cloud storage applications, where fully-dynamic bin packing models the problem of data backup to minimize the number of disks used, as well as communication incurred in moving file backups between disks. Since the set of files changes over time, we could recompute a solution periodically from scratch, but this would give a high number of disk rewrites, incurring a high energy cost and possible wear and tear of the disks. In this work, we present optimal tradeoffs between number of bins used and number of items repacked, as well as natural extensions of the latter measure."}],"doi":"10.4230/LIPIcs.ICALP.2018.51","ddc":["000"],"conference":{"end_date":"2018-07-13","name":"45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)","location":"Prag","start_date":"2018-07-10"},"year":"2018","_id":"2484","intvolume":"       107","publication_identifier":{"issn":["1868-8969"],"isbn":["978-3-95977-076-7"]},"status":"public","author":[{"id":"22704","first_name":"Björn","full_name":"Feldkord, Björn","last_name":"Feldkord"},{"id":"14052","orcid":"0000-0003-1348-6516","first_name":"Matthias","full_name":"Feldotto, Matthias","last_name":"Feldotto"},{"last_name":"Gupta","full_name":"Gupta, Anupam","first_name":"Anupam"},{"first_name":"Guru","full_name":"Guruganesh, Guru","last_name":"Guruganesh"},{"full_name":"Kumar, Amit ","last_name":"Kumar","first_name":"Amit "},{"first_name":"Sören","last_name":"Riechers","full_name":"Riechers, Sören"},{"first_name":"David","last_name":"Wajc","full_name":"Wajc, David"}],"date_created":"2018-04-24T15:21:56Z","publication":"45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)","file_date_updated":"2018-10-31T16:58:18Z","page":"51:1-51:24","type":"conference"}