15 search results - page 1 / 3 » Dynamic Bin Packing of Unit Fractions Items |
ICALP
2005
Springer
13 years 10 months ago
2005
Springer
This paper studies the dynamic bin packing problem, in which items arrive and depart at arbitrary time. We want to pack a sequence of unit fractions items (i.e., items with sizes ...
COCOON
2006
Springer
13 years 8 months ago
2006
Springer
We study the dynamic bin packing problem introduced by Coffman, Garey and Johnson. This problem is a generalization of the bin packing problem in which items may arrive and depart...
ESA
1993
Springer
13 years 9 months ago
1993
Springer
The problem of maintaining an approximate solution for one-dimensional bin packing when items may arrive and depart dynamically is studied. In accordance with various work on fully...
SWAT
2010
Springer
13 years 2 months ago
2010
Springer
As Bin Packing is NP-hard already for k = 2 bins, it is unlikely to be solvable in polynomial time even if the number of bins is a fixed constant. However, if the sizes of the item...
IANDC
2008
13 years 4 months ago
2008
We consider a natural resource allocation problem in which we are given a set of items, where each item has a list of pairs associated with it. Each pair is a configuration of an a...