Comparing online algorithms for bin packing problems

The relative worst-order ratio is a measure of the quality of online algorithms. In contrast to the competitive ratio, this measure compares two online algorithms directly instead of using an intermediate comparison with an optimal offline algorithm.In this paper, we apply the relative worst-order ratio to online algorithms for several common variants of the bin packing problem. We mainly consider pairs of algorithms that are not distinguished by the competitive ratio and show that the relative worst-order ratio prefers the intuitively better algorithm of each pair.

[1]  Leen Stougie,et al.  Online Bin Coloring , 2001, ESA.

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

[3]  W. Marsden.  I and J , 2012 .

[4]  David S. Johnson,et al.  Fast Algorithms for Bin Packing , 1974, J. Comput. Syst. Sci..

[5]  Jian Yang,et al.  The Ordered Open-End Bin-Packing Problem , 2003, Oper. Res..

[6]  Eduardo C. Xavier,et al.  The Class Constrained Bin Packing Problem with Applications to Video-on-Demand , 2006, COCOON.

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

[8]  Lene M. Favrholdt,et al.  Comparing First-Fit and Next-Fit for online edge coloring , 2010, Theor. Comput. Sci..

[9]  Hadas Shachnai,et al.  Tight Bounds for Online Class-Constrained Packing , 2002, LATIN.

[10]  Tjark Vredeveld,et al.  Probabilistic Analysis of Online Bin Coloring Algorithms Via Stochastic Comparison , 2008, ESA.

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

[12]  Ronald L. Graham,et al.  Bounds for certain multiprocessing anomalies , 1966 .

[13]  J. B. G. Frenk,et al.  Two Simple Algorithms for bin Covering , 1999, Acta Cybern..

[14]  Joan Boyar,et al.  The relative worst order ratio applied to seat reservation , 2004, TALG.

[15]  Joan Boyar,et al.  Theoretical Evidence for the Superiority of LRU-2 over LRU for the Paging Problem , 2006, WAOA.

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

[17]  Jeffrey D. Ullman,et al.  Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms , 1974, SIAM J. Comput..

[18]  Leah Epstein,et al.  Separating online scheduling algorithms with the relative worst order ratio , 2006, J. Comb. Optim..

[19]  Joseph Y.-T. Leung,et al.  Variants of Classical One-Dimensional Bin Packing , 2007, Handbook of Approximation Algorithms and Metaheuristics.

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

[21]  János Csirik,et al.  Performance Guarantees for One-Dimensional Bin Packing , 2007, Handbook of Approximation Algorithms and Metaheuristics.

[22]  Jakub Marecek,et al.  Handbook of Approximation Algorithms and Metaheuristics , 2010, Comput. J..

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

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

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

[26]  Joseph Y.-T. Leung,et al.  Variable-Sized Bin Packing and Bin Covering , 2007, Handbook of Approximation Algorithms and Metaheuristics.