A 71/60 theorem for bin packing

Abstract The FIRST FIT DECREASING algorithm for bin packing has long been famous for its guarantee that no packing it generates will use more than 11 9 = 1.222… times the optimal number of bins. We present a simple modified version that has essentially the same running time, should perform at least as well on average, and yet provides a guarantee of 71 60 = 1.18333… .

[1]  Andrew Chi-Chih Yao,et al.  New Algorithms for Bin Packing , 1978, JACM.

[2]  Martin Grötschel,et al.  The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..

[3]  David S. Johnson,et al.  Near-optimal bin packing algorithms , 1973 .

[4]  David S. Johnson,et al.  Approximation Algorithms for Bin-Packing — An Updated Survey , 1984 .

[5]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[6]  Greg N. Frederickson,et al.  Probabilistic Analysis for Simple One- and Two-Dimensional Bin Packing Algorithms , 1980, Inf. Process. Lett..

[7]  G. S. Lueker,et al.  Bin packing can be solved within 1 + ε in linear time , 1981 .

[8]  Frank Thomson Leighton,et al.  Some unexpected expected behavior results for bin packing , 1984, STOC '84.

[9]  G. S. Lueker.  An average-case analysis of bin packing with uniformly distributed item sizes , 1982 .

[10]  L. Khachiyan.  Polynomial algorithms in linear programming , 1980 .

[11]  Ralph E. Gomory,et al.  A Linear Programming Approach to the Cutting Stock Problem---Part II , 1963 .

[12]  David S. Johnson,et al.  Approximation Algorithms for Bin Packing Problems: A Survey , 1981 .

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

[14]  Brenda S. Baker,et al.  A New Proof for the First-Fit Decreasing Bin-Packing Algorithm , 1985, J. Algorithms.

[15]  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).

[16]  R. Gomory,et al.  A Linear Programming Approach to the Cutting-Stock Problem , 1961 .