Bin packing can be solved within 1 + ε in linear time

For any listL ofn numbers in (0, 1) letL* denote the minimum number of unit capacity bins needed to pack the elements ofL. We prove that, for every positive ε, there exists anO(n)-time algorithmS such that, ifS(L) denotes the number of bins used byS forL, thenS(L)/L*≦1+ε for anyL providedL* is sufficiently large.

[1]  L. V. Kantorovich,et al.  Mathematical Methods of Organizing and Planning Production , 1960 .

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

[3]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[4]  Manuel Blum,et al.  Time Bounds for Selection , 1973, J. Comput. Syst. Sci..

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

[6]  Donald E. Knuth,et al.  The Art of Computer Programming, Vol. 3: Sorting and Searching , 1974 .

[7]  David S. Johnson,et al.  Fast Algorithms for Bin Packing , 1974, J. Comput. Syst. Sci..

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

[9]  Jeffrey D. Ullman,et al.  Worst case bounds for simple one-dimensional packing algorithms , 1974 .

[10]  Oscar H. Ibarra,et al.  Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems , 1975, JACM.

[11]  Arnold Schönhage,et al.  Finding the Median , 1976, J. Comput. Syst. Sci..

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

[13]  Sartaj Sahni,et al.  General Techniques for Combinatorial Approximation , 1977, Oper. Res..

[14]  B. Weide.  Statistical methods in algorithm design and analysis. , 1978 .

[15]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

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

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

[18]  Jon Louis Bentley,et al.  Probabilistic Analysis of Algorithms , 1982 .