Tight bounds for minimax grid matching, with applications to the average case analysis of algorithms
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
On the expected behavior of disjoint set union algorithms
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Bounded space on-line bin packing: best is better than first
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Analyzing algorithms by simulation: variance reduction techniques and simulation speedups
ACM Computing Surveys (CSUR)
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
A probabilistic analysis of multidimensional bin packing problems
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Using finite experiments to study asymptotic performance
Experimental algorithmics
Load balancing distributed inverted files
Proceedings of the 9th annual ACM international workshop on Web information and data management
Largest-first sequential selection with a sum constraint
Operations Research Letters
Bin packing as a random walk: A note on knödel's paper
Operations Research Letters
| Hi-index | 0.00 |
We study the asymptotic expected behavior of the First Fit and First Fit Decreasing bin packing algorithms applied to items chosen uniformly from the interval (0,u], u ≤ 1. Our results indicate that the algorithms perform even better than previously expected.