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.
AMS subject classification (1980)68 C 25 68 E 05 90 C 10
Unable to display preview. Download preview PDF.
- M. R. Garey andD. S. Johnson, Approximation algorithms for bin packing problems: a survey,preprint 1980.Google Scholar
- D. S. Johnson,Near optimal bin packing algorithms, Ph. D. Th., MIT, Cambridge, Mass., June 1973.Google Scholar
- R. M. Karp, Reducibility among combinatorial problems, in:Complexity of Computer calculations. (R. E. Miller and J. W. Thatcher, Eds.) Plenum Press, New York, 1972, 85–103.Google Scholar
- D. E. Knuth,The Art of Computer Programming, Vol. 3, Sorting and Searching, Addison-Wesley, Reading, Mass., 1973.Google Scholar
- J. L. Bentley, Probabilistic analysis of algorithms,Applied Probability—Computer Science, the Interface, Boca Raton, Florida, January 1981.Google Scholar
- B. W. Weide,Statistical Methods in Algorithm Design and Analysis, Ph.D. Thesis, Carnegie-Mellon University, Pittsburgh, Pennsylvania (August 1978); appeared as CMU Computer Science Report CMU-CS-78-142.Google Scholar