Author:
Epstein Leah,van Stee Rob
Publisher
Springer Berlin Heidelberg
Reference13 articles.
1. Coffman, E.G., Garey, M.R., Johnson, D.S.: Approximation algorithms for bin packing: A survey. In: Hochbaum, D. (ed.) Approximation algorithms, PWS Publishing Company (1997)
2. Lecture Notes in Computer Science;J. Csirik,1998
3. Csirik, J., Woeginger, G.J.: Resource augmentation for online bounded space bin packing. Journal of Algorithms 44(2), 308–320 (2002)
4. Lecture Notes in Computer Science;L. Epstein,2002
5. Garey, M.R., Graham, R.L., Ullman, J.D.: Worst-case analysis of memory allocation algorithms. In: Proceedings of the Fourth Annual ACM Symposium on Theory of Computing, pp. 143–150. ACM, New York (1972)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献