{"paper":{"title":"Fully-Dynamic Bin Packing with Limited Repacking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amit Kumar, Anupam Gupta, David Wajc, Guru Guruganesh","submitted_at":"2017-11-06T18:49:46Z","abstract_excerpt":"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 \\emph{while repacking items sparingly} between updates. Formally, each item $i$ has a \\emph{movement cost} $c_i\\geq 0$, and we want to use $\\alpha \\cdot OPT$ bins and incur a movement cost $\\gamma\\cdot c_i$, either in the worst case, or in an amortized sense, for $\\alpha, \\gamma$ as small as possible. We call $\\gamma$ the \\emph{recourse} of the algorithm. This is motivated by cloud storage applications, where fully-dy"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.02078","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}