- Authors:
- Joan Boyar,
- Morten N. Nielsen
The lower bound on First-Fit''s accommodating ratio, for the Unit Price Bin Packing problem, is improved to 5/8.
Recommendations
Tight absolute bound for First Fit Decreasing bin-packing: FFD(L)≤11/9OPT(L)+6/9
First Fit Decreasing is a classical bin-packing algorithm: the items are ordered by non-increasing size, and then in this order the next item is always packed into the first bin where it fits. For an instance L let FFD(L) and OPT(L) denote the number of ...
On Dynamic Bin Packing: An Improved Lower Bound and Resource Augmentation Analysis
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 from the packing dynamically. The main result in this paper is a lower ...
Improved lower bounds for the online bin packing problem with cardinality constraints
The bin packing problem has been extensively studied and numerous variants have been considered. The $$k$$ k - item bin packing problem is one of the variants introduced by Krause et al. (J ACM 22:522---550, 1975 ). In addition to the formulation of the ...