Comparing online algorithms for bin packing problems
- 305 Downloads
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.
KeywordsOnline algorithms Relative worst-order ratio Bin packing Bin covering Bin coloring Class-constrained bin packing Open-end bin packing
Unable to display preview. Download preview PDF.
- Boyar, J., Ehmsen, M. R., & Larsen, K. S. (2006). Theoretical evidence for the superiority of LRU-2 over LRU for the paging problem. In Approximation and online algorithms (pp. 95–107). Google Scholar
- Boyar, J., & Medvedev, P. (2008). The relative worst order ratio applied to seat reservation. ACM Transactions on Algorithms, 4(4). Article 48, 22 pp. Google Scholar
- Coffman, E. G., Jr., & Csirik, J. (2007). Performance guarantees for one-dimensional bin packing. In T. F. Gonzalez (Ed.), Handbook of approximation algorithms and metaheuristics. London: Chapman & Hall. Chap. 32, 18 pp. Google Scholar
- Csirik, J., Frenk, J. B. G., Labbé, M., & Zhang, S. (1999). Two simple algorithms for bincovering. Acta Cybernetica, 14(1), 13–25. Google Scholar
- Csirik, J., & Leung, J. Y.-T. (2007a). Variable-sized bin packing and bin covering. In T. F. Gonzalez (Ed.), Handbook of approximation algorithms and metaheuristics. London: Chapman & Hall. Chap. 34, 11 pp. Google Scholar
- Csirik, J., & Leung, J. Y.-T. (2007b). Variants of classical one-dimensional bin packing. In T. F. Gonzalez (Ed.), Handbook of approximation algorithms and metaheuristics. London: Chapman & Hall. Chap. 33, 13 pp. Google Scholar
- Ehmsen, M. R., Favrholdt, L. M., Kohrt, J. S., & Mihai, R. (2008). Comparing First-Fit and Next-Fit for online edge coloring. In 19th international symposium on algorithms and computation (pp. 89–99). Google Scholar
- Graham, R. L. (1966). Bounds for certain multiprocessing anomalies. Bell Systems Technical Journal, 45, 1563–1581. Google Scholar
- Hiller, B., & Vredeveld, T. (2008). Probabilistic analysis of online bin coloring algorithms via stochastic comparison. In Proceedings of the 16th annual European symposium (pp. 528–539). Google Scholar
- Kenyon, C. (1996). Best-fit bin-packing with random order. In Proceedings of the 7th annual ACM-SIAM symposium on discrete algorithms (pp. 359–364). Google Scholar