Author:
Békési József,Dósa György,Epstein Leah
Funder
Austrian–Hungarian Action Foundation
IBM Hungary in cooperation with the University of Pannonia
Subject
Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science
Reference29 articles.
1. Algorithms for on-line bin-packing problems with cardinality constraints;Babel;Discrete Appl. Math.,2004
2. New lower bounds for certain classes of bin packing algorithms;Balogh;Theor. Comput. Sci.,2012
3. J. Balogh, J. Békési, Gy. Dósa, J. Sgall, R. van Stee, The optimal absolute ratio for online bin packing, in: Proc. of the 26th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA2015, pp. 1425–1438.
4. On the absolute approximation ratio for first fit and related results;Boyar;Discrete Appl. Math.,2012
5. Approximation schemes for ordered vector packing problems;Caprara;Nav. Res. Logist.,2003
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献