Author:
Epstein Leah,van Stee Rob
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Reference16 articles.
1. Babel, L., Chen, B., Kellerer, H., Kotov, V.: Algorithms for on-line bin-packing problems with cardinality constraints. Discrete Appl. Math. 143(1–3), 238–251 (2004)
2. Caprara, A., Kellerer, H., Pferschy, U.: Approximation schemes for ordered vector packing problems. Nav. Res. Logist. 92, 58–69 (2003)
3. Chung, F., Graham, R., Mao, J., Varghese, G.: Parallelism versus memory allocation in pipelined router forwarding engines. Theory Comput. Syst. 39(6), 829–849 (2006)
4. Epstein, L.: Online bin packing with cardinality constraints. SIAM J. Discrete Math. 20(4), 1015–1030 (2006)
5. Epstein, L., Levin, A.: AFPTAS results for common variants of bin packing: A new method to handle the small items. Manuscript (2007)
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献