Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Fast algorithms for bin packing
Journal of Computer and System Sciences
Hi-index | 0.00 |
Consider independent identically distributed random variables (X"i) valued in [0,1]. Let B(n) be the optimal (minimum) number of unit size bins needed to pack n items of size X"1, X"2,...,X"n. We prove that there exists a numerical constant C such that for t 0, Pr(|B(n)-E(B(n))|tn)@? C exp(- t). The constant C does not depend on the distribution of X.