Online Results for Black and White Bin Packing
暂无分享,去创建一个
Zsolt Tuza | Hans Kellerer | Leah Epstein | József Békési | György Dósa | János Balogh | H. Kellerer | Z. Tuza | L. Epstein | J. Balogh | J. Békési | G. Dósa
[1] Jeffrey D. Ullman,et al. The performance of a memory allocation algorithm , 1971 .
[2] David S. Johnson,et al. Near-optimal bin packing algorithms , 1973 .
[3] David S. Johnson,et al. Fast Algorithms for Bin Packing , 1974, J. Comput. Syst. Sci..
[4] Jeffrey D. Ullman,et al. Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms , 1974, SIAM J. Comput..
[5] Andrew Chi-Chih Yao,et al. Probabilistic computations: Toward a unified measure of complexity , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).
[6] M. Garey. Johnson: computers and intractability: a guide to the theory of np- completeness (freeman , 1979 .
[7] David S. Johnson,et al. Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .
[8] M. Golumbic. Algorithmic graph theory and perfect graphs , 1980 .
[9] G. S. Lueker,et al. Bin packing can be solved within 1 + ε in linear time , 1981 .
[10] Richard M. Karp,et al. An efficient approximation scheme for the one-dimensional bin-packing problem , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[11] D. T. Lee,et al. A simple on-line bin-packing algorithm , 1985, JACM.
[12] R. Möhring. Algorithmic graph theory and perfect graphs , 1986 .
[13] A. Brandstädt,et al. Graph Classes: A Survey , 1987 .
[14] André van Vliet,et al. An Improved Lower Bound for On-Line Bin Packing Algorithms , 1992, Inf. Process. Lett..
[15] D. Simchi-Levi. New worst‐case results for the bin‐packing problem , 1994 .
[16] Klaus Jansen,et al. Approximation Algorithms for Time Constrained Scheduling , 1995, IRREGULAR.
[17] Gerhard J. Woeginger,et al. On-line Packing and Covering Problems , 1996, Online Algorithms.
[18] Edward G. Coffman,et al. Approximation algorithms for bin packing: a survey , 1996 .
[19] Dorit S. Hochbaum,et al. Approximation Algorithms for NP-Hard Problems , 1996 .
[20] Klaus Jansen. An Approximation Scheme for Bin Packing with Conflicts , 1999, J. Comb. Optim..
[21] Steven S. Seiden,et al. On the online bin packing problem , 2001, JACM.
[22] Prabhu Manyem,et al. Approximation Lower Bounds in Online LIB Bin Packing and Covering , 2003, J. Autom. Lang. Comb..
[23] M. Golumbic. Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57) , 2004 .
[24] Martin Charles Golumbic. Not So Perfect Graphs , 2004 .
[25] Leah Epstein,et al. On Bin Packing with Conflicts , 2008, SIAM J. Optim..
[26] L. Epstein. On online bin packing with LIB constraints , 2009 .
[27] Binzhou Xia,et al. Tighter bounds of the First Fit algorithm for the bin-packing problem , 2010, Discret. Appl. Math..
[28] Leah Epstein,et al. On the absolute approximation ratio for First Fit and related results , 2012, Discret. Appl. Math..
[29] József Békési,et al. New lower bounds for certain classes of bin packing algorithms , 2012, Theor. Comput. Sci..
[30] Zsolt Tuza,et al. Black and White Bin Packing , 2012, WAOA.
[31] Zsolt Tuza,et al. Bin covering with a general profit function: approximability results , 2013, Central Eur. J. Oper. Res..
[32] Jirí Sgall,et al. First Fit bin packing: A tight analysis , 2013, STACS.
[33] Zsolt Tuza,et al. Bin packing with “Largest In Bottom” constraint: tighter bounds and generalizations , 2013, J. Comb. Optim..