Bin packing with “Largest In Bottom” constraint: tighter bounds and generalizations
暂无分享,去创建一个
Zsolt Tuza | Deshi Ye | György Dósa | Z. Tuza | Deshi Ye | G. Dósa
[1] Jeffrey D. Ullman,et al. Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms , 1974, SIAM J. Comput..
[2] András Gyárfás,et al. On-line and first fit colorings of graphs , 1988, J. Graph Theory.
[3] Allan Borodin,et al. Online computation and competitive analysis , 1998 .
[4] André van Vliet,et al. An Improved Lower Bound for On-Line Bin Packing Algorithms , 1992, Inf. Process. Lett..
[5] Binzhou Xia,et al. Tighter bounds of the First Fit algorithm for the bin-packing problem , 2010, Discret. Appl. Math..
[6] Leah Epstein,et al. On Bin Packing with Conflicts , 2008, SIAM J. Optim..
[7] Ben Dushnik,et al. Partially Ordered Sets , 1941 .
[8] Steven S. Seiden,et al. On the online bin packing problem , 2001, JACM.
[9] Klaus Jansen,et al. Approximation Algorithms for Time Constrained Scheduling , 1997, Inf. Comput..
[10] Robin Milner. An Action Structure for Synchronous pi-Calculus , 1993, FCT.
[11] Edward G. Coffman,et al. Approximation algorithms for bin packing: a survey , 1996 .
[12] Leah Epstein,et al. Multi-dimensional Packing with Conflicts , 2007, FCT.
[13] Peter C. Fishburn,et al. Partial orders of dimension 2 , 1972, Networks.
[14] Dorit S. Hochbaum,et al. Approximation Algorithms for NP-Hard Problems , 1996 .
[15] Helmut Neunzert,et al. Topics in Industrial Mathematics , 2000 .
[16] L. Epstein. On online bin packing with LIB constraints , 2009 .
[17] Klaus Jansen,et al. An Approximation Scheme for Bin Packing with Conflicts , 1998, J. Comb. Optim..
[18] Prabhu Manyem,et al. Approximation Lower Bounds in Online LIB Bin Packing and Covering , 2003, J. Autom. Lang. Comb..
[19] Carsten Lund,et al. On the hardness of approximating minimization problems , 1993, STOC.
[20] Luke Finlay,et al. Online LIB problems: Heuristics for Bin Covering and lower bounds for Bin Packing , 2005, RAIRO Oper. Res..