2 search results - page 1 / 1 » Fully Dynamic Bin Packing Revisited |
ESA
1993
Springer
13 years 10 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 4 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...