Author:
Epstein Leah,Favrholdt Lene M.,Kohrt Jens S.
Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Management Science and Operations Research,General Engineering,Software
Reference24 articles.
1. Assman, S. F., Johnson, D. S., Kleitman, D. J., & Leung, J. Y.-T. (1984). On a dual version of the one-dimensional bin packing problem. Journal of Algorithms, 5(4), 502–525.
2. Ben-David, S., & Borodin, A. (1994). A new measure for the study of on-line algorithms. Algorithmica, 11(1), 73–91.
3. 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).
4. Boyar, J., & Favrholdt, L. M. (2007). The relative worst order ratio for online algorithms. ACM Transactions on Algorithms, 3(2), 22.
5. Boyar, J., Favrholdt, L. M., & Larsen, K. S. (2007). The relative worst order ratio applied to paging. Journal of Computer and System Sciences, 73(5), 818–843.
Cited by
25 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献