Linear Waste of Best Fit Bin Packing on Skewed Distributions

Random Structures and Algorithms

Volumn 20, Issue 3, 2002, Pages 441-464

  Kenyon, Claire ^a   Mitzenmacher, Michael ^b  

^a UNIVERSITÉ PARIS SACLAY   (France)

^b HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0036114885     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/rsa.10037     Document Type: Conference Paper

References (15)

1. Problems in analysis of algorithms pages, http://pauillac.inria.fr/algo/AofA/Problems/index.html. Problem 5, posted by Ed Coffman.
2. S. Albers and M. Mitzenmacher, Average case analyses of First Fit and Random Fit bin packing, Proc 9th Annu ACM Symp Discrete Alg, 1998, pp. 290-299.
3. D. P. Bertsekas and J. N. Tsitsiklis, Neuro-dynamic programming, Athena Scientific, Boston, 1996.
4. E. G. Coffman, Jr., C. Courcoubetis, M. R. Garey, D. S. Johnson, L. A. McGeoch, P. W. Shor, R. R. Weber, and M. Yannakakis, Fundamental discrepancies between average-case analyses under discrete and continuous distributions: A bin-packing case study, Proc 23rd Annu ACM Symp Theory Comput, 1991, pp. 230-240.
5. E. G. Coffman, Jr., M. R. Garey, and D. S. Johnson, Approximation algorithms for bin packing: A survey, Approximation algorithms for NP-hard problems, D. S. Hochbaum (Editor), PWS, Boston, 1996.
6. E. G. Coffman, Jr., D. S. Johnson, P. W. Shor, and R. R. Weber, Markov chains, computer proofs and average-case analysis of Best Fit bin packing, Proc 25th Annu ACM Symp Theory Comput 1993, pp. 412-421.
7. M. Hofri, Analysis of algorithms - mathematical methods, computational tools, Oxford University Press, Oxford, October 1995.
8. D. S. Johnson, A. Demers, J. D. Ullman, M. R. Garey, and R. L. Graham, Worst case performance bounds for simple one-dimensional packing algorithms, SIAM J Comput 3 (1974), 299-325.
9. N. Karmakar, Probabilistic analysis of some bin-packing problems, IEEE FOCS 1982, pp. 107-111.
10. C. Kenyon, Y. Rabani, and A. Sinclair, Biased random walks, Lyapunov functions, and stochastic analysis of Best Fit bin packing, J Alg 27(2) (1998), 218-235.
11. F. T. Leighton and P. W. Shor, Tight bounds for minimax grid matching with application to the average case analysis of algorithms, Combinatorica 9 (1989), 161-187.
12. J. Mosely and P. A. Humblet, A class of efficient contention resolution algorithms for multiple access channels, IEEE Trans Commun 33(2) (1985), 145-151.
13. M. Puterman, Markov decision processes: Discrete stochastic dynamic programming, Wiley, New York, 1994.
14. M. Snaked and J. G. Shanthikumar, Stochastic orders and their applications, Academic Press, San Diego, 1994.
15. P. W. Shor, The average case analysis of some on-line algorithms for bin packing, Combinatorica 6 (1986), 179-200.