Black and White Bin Packing
暂无分享,去创建一个
[1] L. Epstein. On online bin packing with LIB constraints , 2009 .
[2] Klaus Jansen,et al. An Approximation Scheme for Bin Packing with Conflicts , 1998, J. Comb. Optim..
[3] Jeffrey D. Ullman,et al. Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms , 1974, SIAM J. Comput..
[4] Johan Håstad,et al. Clique is hard to approximate within n/sup 1-/spl epsiv// , 1996, Proceedings of 37th Conference on Foundations of Computer Science.
[5] Leah Epstein,et al. Multi-dimensional Packing with Conflicts , 2007, FCT.
[6] J. Håstad. Clique is hard to approximate withinn1−ε , 1999 .
[7] Csilla Bujtás,et al. The Graph-Bin Packing Problem , 2011, Int. J. Found. Comput. Sci..
[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] Binzhou Xia,et al. Tighter bounds of the First Fit algorithm for the bin-packing problem , 2010, Discret. Appl. Math..
[11] Prabhu Manyem,et al. Approximation Lower Bounds in Online LIB Bin Packing and Covering , 2003, J. Autom. Lang. Comb..
[12] 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).
[13] David Zuckerman. Linear Degree Extractors and the Inapproximability of Max Clique and Chromatic Number , 2007, Theory Comput..
[14] György Dósa,et al. The Tight Bound of First Fit Decreasing Bin-Packing Algorithm Is FFD(I) <= 11/9OPT(I) + 6/9 , 2007, ESCAPE.
[15] Mike Paterson,et al. Combinatorics, Algorithms, Probabilistic and Experimental Methodologies, First International Symposium, ESCAPE 2007, Hangzhou, China, April 7-9, 2007, Revised Selected Papers , 2007, ESCAPE.
[16] József Békési,et al. New lower bounds for certain classes of bin packing algorithms , 2012, Theor. Comput. Sci..
[17] Edward G. Coffman,et al. Approximation algorithms for bin packing: a survey , 1996 .
[18] Robin Milner. An Action Structure for Synchronous pi-Calculus , 1993, FCT.
[19] Zsolt Tuza,et al. Bin packing with “Largest In Bottom” constraint: tighter bounds and generalizations , 2013, J. Comb. Optim..
[20] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[21] André van Vliet,et al. An Improved Lower Bound for On-Line Bin Packing Algorithms , 1992, Inf. Process. Lett..
[22] Helmut Neunzert,et al. Topics in Industrial Mathematics , 2000 .
[23] Zsolt Tuza,et al. Bin covering with a general profit function: approximability results , 2013, Central Eur. J. Oper. Res..
[24] Leah Epstein,et al. On Bin Packing with Conflicts , 2008, SIAM J. Optim..
[25] G. S. Lueker,et al. Bin packing can be solved within 1 + ε in linear time , 1981 .
[26] D. T. Lee,et al. A simple on-line bin-packing algorithm , 1985, JACM.
[27] Leah Epstein,et al. On the absolute approximation ratio for First Fit and related results , 2012, Discret. Appl. Math..