STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Markov chains, computer proofs, and average-case analysis of best fit bin packing
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Analysis of algorithms: computational methods and mathematical tools
Analysis of algorithms: computational methods and mathematical tools
Approximation algorithms for bin packing: a survey
Approximation algorithms for NP-hard problems
Biased random walks, Lyapunov functions, and stochastic analysis of best fit bin packing
Journal of Algorithms
Average-case analyses of first fit and random fit bin packing
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Markov Decision Processes: Discrete Stochastic Dynamic Programming
Markov Decision Processes: Discrete Stochastic Dynamic Programming
Neuro-Dynamic Programming
Sum-of-squares heuristics for bin packing and memory allocation
Journal of Experimental Algorithmics (JEA)
Hi-index | 0.00 |
We prove that Best Fit bin packing has linear waste on the discrete distribution U{j, k} (where items are drawn uniformly from the set {1/k,2/k ..... j/k}) for sufficiently large k when j = αk and 0.66 ≥ α 2/3. Our results extend to continuous skewed distributions, where items are drawn uniformly on [0, a], for 0.66 ≥ a 2/3. This implies that the expected asymptotic performance ratio of Best Fit is strictly greater than 1 for these distributions.