Tight results for Next Fit and Worst Fit with resource augmentation

It is well known that the two simple algorithms for the classic bin packing problem, NF and WF both have an approximation ratio of 2. However, WF seems to be a more reasonable algorithm, since it never opens a new bin if an existing bin can still be used. Using resource augmented analysis, where the output of an approximation algorithm, which can use bins of size b > 1, is compared to an optimal packing into bins of size 1, we give a complete analysis of the asymptotic approximation ratio of WF and of NF, and use it to show that WF is strictly better than NF for any 1 < b < 2, while they have the same asymptotic performance guarantee for all b ≥ 2, and

• Type: Journal
• Year: 2010
• Where: TCS
• Authors: Joan Boyar, Leah Epstein, Asaf Levin
• Keywords: Algorithm, Approximation Ratio, Bin Packing Problem, TCS 2010, Theoretical Computer Science