Author:
Asgeirsson Eyjolfur Ingi,Stein Cliff
Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Management Science and Operations Research,General Engineering,Software
Reference15 articles.
1. Asgeirsson, E. I., & Stein, C. (2006). Using Markov chains to design algorithms for on-line bounded-space bin-cover. In Proceedings of the ACM-SIAM workshop on algorithm engineering and experiments (pp. 75–85).
2. Assman, A. B., Johnson, D. J., Kleitman, D. J., & Leung, J. Y.-T. (1984). On a dual version of the one-dimensional bin packing problem. Journal of Algorithms, 5, 502–525.
3. Coffman, E. G. Jr., & Lueker, G. S. (1991). An introduction to the probabilistic analysis of packing and partitioning algorithms. New York: Wiley.
4. Coffman, E. G. Jr., Johnson, D. S., Shor, P. W., & Weber, R. R. (1993). Markov chains, computer proofs, and average-case analysis of best fit bin packing. In STOC ’93: Proceedings of the twenty-fifth annual ACM symposium on theory of computing (pp. 412–421).
5. Coffman, E. G. Jr., Courcoubetis, C., Garey, M. R., Johnson, D. S., Shor, P. W., Weber, R. R., & Yannakakis, M. (2002). Perfect packing theorems and the average case behavior of optimal and on-line packings. SIAM Review, 44, 384–402.
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献