The relative worst order ratio for online algorithms

We define a new measure for the quality of online algorithms, the relative worst order ratio, using ideas from the max/max ratio [Ben-David and Borodin 1994] and from the random order ratio [Kenyon 1996]. The new ratio is used to compare online algorithms directly by taking the ratio of their performances on their respective worst permutations of a worst-case sequence. Two variants of the bin packing problem are considered: the classical bin packing problem, where the goal is to fit all items in as few bins as possible, and the dual bin packing problem, which is the problem of maximizing the number of items packed in a fixed number of bins. Several known algorithms are compared using this new measure, and a new, simple variant of first-fit is proposed for dual bin packing. Many of our results are consistent with those previously obtained with the competitive ratio or the competitive ratio on accommodating sequences, but new separations and easier proofs are found.

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

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

[3]  Joan Boyar,et al.  The Competitive Ratio for On-Line Dual Bin Packing with Restricted Input Sequences , 2001, Nord. J. Comput..

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

[5]  Joan Boyar,et al.  The Accommodating Function: A Generalization of the Competitive Ratio , 2001, SIAM J. Comput..

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

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

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

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

[10]  Leah Epstein,et al.  The maximum resource bin packing problem , 2005, Theor. Comput. Sci..

[11]  Christos H. Papadimitriou,et al.  Beyond competitive analysis [on-line algorithms] , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

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

[13]  Yossi Azar,et al.  Fair versus Unrestricted Bin Packing , 2002, Algorithmica.

[14]  Joan Boyar,et al.  The Seat Reservation Problem , 1999, Algorithmica.

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

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

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

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

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