A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
Bin packing with fragmentable items: Presentation and approximations
2015
Theoretical Computer Science
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 then we present a 6 5 -approximation algorithm for a special case in which all bins have the same capacities.
doi:10.1016/j.tcs.2015.08.005
fatcat:75ez3wa4pjdt7c7767kcmpeiqa