Bin packing with fragmentable items: Presentation and approximations - Equipe : Graphes, Algorithmes et Combinatoire Accéder directement au contenu
Article Dans Une Revue Theoretical Computer Science Année : 2015

Bin packing with fragmentable items: Presentation and approximations

Résumé

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.

Dates et versions

hal-01206602 , version 1 (29-09-2015)

Identifiants

Citer

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

Altmetric

Partager

Gmail Facebook X LinkedIn More