Skip to Main content Skip to Navigation
Journal articles

Bin packing with fragmentable items: Presentation and approximations

Abstract : We consider a variant of the Bin Packing Problem dealing with fragmentable items. Given a fixed number of bins, the objective is to put all the items into the bins by splitting them in a minimum number of fragments. This problem is useful for modeling splittable resource allocation. In this paper we introduce the problem and its complexity. We give and prove several properties then we present various approximation algorithms and specially a 6/5-approximation algorithm.
Complete list of metadata
Contributor : Marc-Antoine Weisser Connect in order to contact the contributor
Submitted on : Tuesday, September 29, 2015 - 1:33:20 PM
Last modification on : Saturday, June 25, 2022 - 10:17:38 PM

Links full text



Bertrand Lecun, Thierry Mautor, Franck Quessette, Marc-Antoine Weisser. Bin packing with fragmentable items: Presentation and approximations. Theoretical Computer Science, Elsevier, 2015, 602, ⟨10.1016/j.tcs.2015.08.005⟩. ⟨hal-01206602⟩



Record views