Probabilistic Analysis of the Dual Next-Fit Algorithm for Bin Covering

In the bin covering problem, the goal is to fill as many bins as possible up to a certain minimal level with a given set of items of different sizes. Online variants, in which the items arrive one after another and have to be packed immediately on their arrival without knowledge about the future items, have been studied extensively in the literature. We study the simplest possible online algorithm Dual Next-Fit, which packs all arriving items into the same bin until it is filled and then proceeds with the next bin in the same manner. The competitive ratio of this and any other reasonable online algorithm is 1 / 2.

[1]  J. B. G. Frenk,et al.  Probabilistic Analysis of Algorithms for Dual Bin Packing Problems , 1991, J. Algorithms.

[2]  Claire Mathieu,et al.  Better approximation algorithms for bin covering , 2001, SODA '01.

[3]  Joseph Y.-T. Leung,et al.  On a Dual Version of the One-Dimensional Bin Packing Problem , 1984, J. Algorithms.

[4]  Elizabeth L. Wilmer,et al.  Markov Chains and Mixing Times , 2008 .

[5]  Clifford Stein,et al.  Bounded-space online bin cover , 2009, J. Sched..

[6]  R. Weber,et al.  STABILITY OF ON-LINE BIN PACKING WITH RANDOM ARRIVALS AND LONG-RUN-AVERAGE CONSTRAINTS , 1990 .

[7]  Wei-Liem Loh.  Stein's Method and Multinomial Approximation , 1992 .

[8]  Lajos Rónyai,et al.  Random-order bin packing , 2008, Discret. Appl. Math..

[9]  A. Konheim,et al.  An Occupancy Discipline and Applications , 1966 .

[10]  Kim S. Larsen,et al.  Online bin covering: Expectations vs. guarantees , 2013, Theor. Comput. Sci..

[11]  G. Lorden.  On Excess Over the Boundary , 1970 .

[12]  Wansoo T. Rhee,et al.  Optimal Bin Covering with Items of Random Size , 1989, SIAM J. Comput..

[13]  Klaus Jansen,et al.  An asymptotic fully polynomial time approximation scheme for bin covering , 2003, Theor. Comput. Sci..

[14]  János Csirik,et al.  Online algorithms for a dual version of bin packing , 1988, Discret. Appl. Math..

[15]  Raphael Rom,et al.  Average Case Analysis of Bounded Space Bin Packing Algorithms , 2007, Algorithmica.

[16]  C. Kenyon.  Best-fit bin-packing with random order , 1996, SODA '96.