The Relative Worst Order Ratio for On-Line Algorithms
We consider a new measure for the quality of on-line algorithms, the relative worst order ratio, using ideas from the Max/Max ratio  and from the random order ratio . The new ratio is used to compare on-line algorithms directly by taking the ratio of their performances on their respective worst orderings of a worst-case sequence. Two variants of the bin packing problem are considered: the Classical Bin Packing Problem and the Dual Bin Packing Problem. Standard algorithms are compared using this new measure. Many of the results obtained here are consistent with those previously obtained with the competitive ratio or the competitive ratio on accommodating sequences, but new separations and easier results are also shown to be possible with the relative worst order ratio.
KeywordsCompetitive Ratio Large Item Small Item Request Sequence Order Ratio
Unable to display preview. Download preview PDF.
- 3.J. Boyar, L. M. Favrholdt, and K. S. Larsen. Work in progress.Google Scholar
- 5.R. L. Graham. Bounds for Certain Multiprocessing Anomalies. Bell Systems Technical Journal, 45:1563–1581, 1966.Google Scholar
- 8.C. Kenyon. Best-Fit Bin-Packing with Random Order. In 7th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 359–364, 1996.Google Scholar
- 9.E. Koutsoupias and C. H. Papadimitriou. Beyond Competitive Analysis. In 35th Annual Symposium on Foundations of Computer Science, pages 394–400, 1994.Google Scholar