Bin Packing with Fragmentable Items: Presentation and Approximations

Bertrand Lecun (1) , Thierry Mautor (1) , Franck Quessette (1) , Marc-Antoine Weisser (2)

1 PRISM - Parallélisme, Réseaux, Systèmes, Modélisation
2 E3S - Supélec Sciences des Systèmes

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.

Mots clés: Bin packing; fragmentable object; approximation algorithm

Domaines: Mathématique discrète [cs.DM]; Algorithme et structure de données [cs.DS]; Recherche opérationnelle [math.OC]

Bertrand Lecun, Thierry Mautor, Franck Quessette, Marc-Antoine Weisser. Bin Packing with Fragmentable Items: Presentation and Approximations. 2013. ⟨hal-00780434⟩