暂无分享,去创建一个
[1] Andrew Chi-Chih Yao,et al. New Algorithms for Bin Packing , 1978, JACM.
[2] József Békési,et al. New lower bounds for certain classes of bin packing algorithms , 2010, Theor. Comput. Sci..
[3] G. Woeginger,et al. Improved Lower Bounds for Online Hypercube and Rectangle Packing , 2016 .
[4] D. T. Lee,et al. A simple on-line bin-packing algorithm , 1985, JACM.
[5] Yoshiharu Kohayakawa,et al. A tight lower bound for an online hypercube packing problem and bounds for prices of anarchy of a related game , 2018, LATIN.
[6] Leah Epstein,et al. Lower bounds for several online variants of bin packing , 2017, WAOA.
[7] Steven S. Seiden,et al. On the online bin packing problem , 2001, JACM.
[8] Henrik I. Christensen,et al. Approximation and online algorithms for multidimensional bin packing: A survey , 2017, Comput. Sci. Rev..
[9] Edward G. Coffman,et al. Approximation algorithms for bin packing: a survey , 1996 .
[10] Rob van Stee,et al. Beating the Harmonic lower bound for online bin packing , 2015, ICALP.
[11] André van Vliet,et al. An Improved Lower Bound for On-Line Bin Packing Algorithms , 1992, Inf. Process. Lett..
[12] Leah Epstein,et al. Optimal Online Algorithms for Multidimensional Packing Problems , 2005, SIAM J. Comput..
[13] Daniele Vigo,et al. Bin packing approximation algorithms: Survey and classification , 2013 .
[14] János Csirik,et al. An on-line algorithm for multidimensional bin packing , 1993, Oper. Res. Lett..
[15] Alan M. Frieze,et al. Random graphs , 2006, SODA '06.
[16] Leah Epstein,et al. Bounds for online bounded space hypercube packing , 2007, Discret. Optim..