Online bin covering: Expectations vs. guarantees

Bin covering is a dual version of classic bin packing. As usual, bins have size one and items with sizes between zero and one must be packed. However, in bin covering, the objective is to cover as many bins as possible, where a bin is covered if the sizes of items placed in the bin sum up to at least one. We are considering the online version of bin covering. Two classic algorithms for online bin packing that have natural dual versions are Harmonic k and Next-Fit. Though these two algorithms are quite different in nature, competitive analysis does not distinguish these bin covering algorithms.

[1]  Leah Epstein,et al.  Comparing online algorithms for bin packing problems , 2012, J. Sched..

[2]  Joan Boyar,et al.  The relative worst order ratio for online algorithms , 2007, TALG.

[3]  Joan Boyar,et al.  The relative worst order ratio applied to paging , 2005, SODA '05.

[4]  J. Hoffmann-jorgensen,et al.  Probability with a View Toward Statistics , 1994 .

[5]  J. Hoffman-Jorgensen.  Probability with a View Towards Statistics, Volume II , 1994 .

[6]  Joan Boyar,et al.  Relative interval analysis of paging algorithms on access graphs , 2015, Theor. Comput. Sci..

[7]  Steven S. Seiden,et al.  On the online bin packing problem , 2001, JACM.

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

[9]  Joan Boyar,et al.  Access Graphs Results for LRU versus FIFO under Relative Worst Order Analysis , 2012, SWAT.

[10]  D. T. Lee,et al.  A simple on-line bin-packing algorithm , 1985, JACM.

[11]  D. T. Lee,et al.  On-Line Bin Packing in Linear Time , 1989, J. Algorithms.

[12]  Gerhard J. Woeginger,et al.  On-line Packing and Covering Problems , 1996, Online Algorithms.

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

[14]  Alejandro López-Ortiz,et al.  A Survey of Performance Measures for On-line Algorithms , 2005, SIGACT News.

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

[16]  Sandy Irani,et al.  A Comparison of Performance Measures for Online Algorithms , 2014, Algorithmica.

[17]  Kim S. Larsen,et al.  List Factoring and Relative Worst Order Analysis , 2012, Algorithmica.

[18]  Joan Boyar,et al.  A comparison of performance measures via online search , 2011, Theor. Comput. Sci..

[19]  Gerhard J. Woeginger.  Improved Space for Bounded-Space, On-Line Bin-Packing , 1993, SIAM J. Discret. Math..

[20]  Marek Chrobak,et al.  SIGACT news online algorithms column 8 , 2005, SIGA.

[21]  Joan Boyar,et al.  The Relative Worst Order Ratio for On-Line Algorithms , 2003, CIAC.

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

[23]  Anna R. Karlin,et al.  Competitive snoopy caching , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[24]  R. Durrett.  Probability: Theory and Examples , 1993 .

[25]  M. Abramowitz,et al.  Handbook of Mathematical Functions With Formulas, Graphs and Mathematical Tables (National Bureau of Standards Applied Mathematics Series No. 55) , 1965 .

[26]  Robert E. Tarjan,et al.  Amortized efficiency of list update and paging rules , 1985, CACM.

[27]  Allan Borodin,et al.  A new measure for the study of on-line algorithms , 2005, Algorithmica.

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