Download:
|
by Claire Kenyon, Universite Paris-sud, Michael Mitzenmacher
http://www.lri.fr/~kenyon/km-packing.ps.gz
Add To MetaCart
Abstract:
We prove that Best Fit bin packing has linear waste on the discrete distribution Ufj; kg (where items are drawn uniformly from the set f1=k; 2=3; \Delta \Delta \Delta; j=kg) for sufficiently large k when j = ffk and 0:66 ff! 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
Citations
|
548
|
Markov decision processes : discrete stochastic dynamic programming
– Puterman
- 1994
|
|
127
|
Approximation algorithms for bin packing: A survey
– Jr, Garey, et al.
- 1996
|
|
95
|
Stochastic Orders and Their Applications
– Shaked, Shanthikumar
- 1994
|
|
31
|
Biased Random Walks, Lyapunov Functions, and Stochastic Analysis of Best Fit Bin Packing
– Kenyon, Rabani, et al.
- 1998
|
|
27
|
Markov chains, computer proofs, and average-case analysis of Best Fit bin packing
– Coffman, Johnson, et al.
- 1993
|
|
23
|
Fundamental discrepancies between average-case analyses under discrete and continuous distributions
– Coffman, Courcoubetis, et al.
- 1991
|
|
21
|
Tight Bounds for Minimax Grid Matching with Applications to the Average Case Analysis of Algorithms
– Leighton, Shor
- 1989
|
|
18
|
Humblet, “A class of efficient contention resolution algorithms for multiple access
– Mosely, A
- 1985
|
|
15
|
The average case analysis of some on-line algorithms for bin packing
– Shor
- 1986
|
|
14
|
Worst case performance bounds for simple one-dimensional packing algorithms
– Johnson, Demers, et al.
- 1974
|
|
2
|
Average case analyses of First Fit and Random Fit bin packing
– Albers, Mitzenmacher
- 1998
|
|
2
|
Probabilistic Analysis of Some Bin-Packing Problems
– Karmakar
- 1982
|
