Abstract
We consider a new measure for the quality of on-line algorithms, the relative worst order ratio, using ideas from the Max/Max ratio [2] and from the random order ratio [8]. 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.
Supported in part by the Danish Natural Science Research Council (SNF) and in part by the Future and Emerging Technologies program of the EU under contract number IST-1999-14186 (alcom-ft).
Part of this work was done while visiting the Computer Science Department, University of Toronto.
Part of this work was done while working at the Department of Mathematics and Computer Science, University of Southern Denmark.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Y. Azar, J. Boyar, L. Epstein, L. M. Favrholdt, K. S. Larsen, and M. N. Nielsen. Fair versus Unrestricted Bin Packing. Algorithmica, 34(2):181–196, 2002.
S. Ben-David and A. Borodin. A New Measure for the Study of On-Line Algorithms. Algorithmica, 11(1):73–91, 1994.
J. Boyar, L. M. Favrholdt, and K. S. Larsen. Work in progress.
J. Boyar, K. S. Larsen, and M. N. Nielsen. The Accommodating Function—a Generalization of the Competitive Ratio. SIAM Journal of Computation, 31(1):233–258, 2001. Also in WADS 99, pages 74–79.
R. L. Graham. Bounds for Certain Multiprocessing Anomalies. Bell Systems Technical Journal, 45:1563–1581, 1966.
D. S. Johnson. Fast Algorithms for Bin Packing. Journal of Computer and System Sciences, 8:272–314, 1974.
A. R. Karlin, M. S. Manasse, L. Rudolph, and D. D. Sleator. Competitive Snoopy Caching. Algorithmica, 3(1):79–119, 1988.
C. Kenyon. Best-Fit Bin-Packing with Random Order. In 7th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 359–364, 1996.
E. Koutsoupias and C. H. Papadimitriou. Beyond Competitive Analysis. In 35th Annual Symposium on Foundations of Computer Science, pages 394–400, 1994.
D. D. Sleator and R. E. Tarjan. Amortized Efficiency of List Update and Paging Rules. Communications of the ACM, 28(2):202–208, 1985.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Boyar, J., Favrholdt, L.M. (2003). The Relative Worst Order Ratio for On-Line Algorithms. In: Petreschi, R., Persiano, G., Silvestri, R. (eds) Algorithms and Complexity. CIAC 2003. Lecture Notes in Computer Science, vol 2653. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44849-7_13
Download citation
DOI: https://doi.org/10.1007/3-540-44849-7_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40176-6
Online ISBN: 978-3-540-44849-5
eBook Packages: Springer Book Archive