First Fit Algorithm for Bin Packing

[1]  Jeffrey D. Ullman,et al.  Worst-case analysis of memory allocation algorithms , 1972, STOC.

[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]  David P. Williamson,et al.  The Design of Approximation Algorithms , 2011 .

[5]  Leah Epstein,et al.  On the absolute approximation ratio for First Fit and related results , 2012, Discret. Appl. Math..

[6]  Jirí Sgall,et al.  First Fit bin packing: A tight analysis , 2013, STACS.

[7]  Jeffrey D. Ullman,et al.  Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms , 1974, SIAM J. Comput..

[8]  Jirí Sgall,et al.  Optimal Analysis of Best Fit Bin Packing , 2014, ICALP.

[9]  Andrew Chi-Chih Yao,et al.  Resource Constrained Scheduling as Generalized Bin Packing , 1976, J. Comb. Theory A.

[10]  Binzhou Xia,et al.  Tighter bounds of the First Fit algorithm for the bin-packing problem , 2010, Discret. Appl. Math..

[11]  Edward G. Coffman,et al.  Approximation algorithms for bin packing: a survey , 1996 .

[12]  Jeffrey D. Ullman,et al.  The performance of a memory allocation algorithm , 1971 .

[13]  Jirí Sgall,et al.  A New Analysis of Best Fit Bin Packing , 2012, FUN.

[14]  Ronald L. Graham,et al.  Bounds on Multiprocessing Timing Anomalies , 1969, SIAM Journal of Applied Mathematics.

[15]  Ronald L. Graham,et al.  Bounds for certain multiprocessing anomalies , 1966 .

[16]  D. Simchi-Levi.  New worst‐case results for the bin‐packing problem , 1994 .

[17]  Zsolt Tuza,et al.  Tight absolute bound for First Fit Decreasing bin-packing: FFD(l) ≤ 11/9 OPT(L) + 6/9 , 2013, Theor. Comput. Sci..

[18]  Vijay V. Vazirani,et al.  Approximation Algorithms , 2001, Springer Berlin Heidelberg.