Linear waste of Best Fit bin packing on skewed distributions

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2000, Pages 582-589

  Kenyon, Claire ^a   Mitzenmacher, Michael ^b  

^a UNIVERSITÉ PARIS SACLAY   (France)

^b HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; SET THEORY; THEOREM PROVING;

BEST FIT BIN PACKING; SKEWED DISTRIBUTIONS;

PROBABILITY DISTRIBUTIONS;

EID: 0034498376     PISSN: 02725428     EISSN: None     Source Type: Journal    
DOI: 10.1109/SFCS.2000.892326     Document Type: Article

References (14)

1. Problems in Analysis of Algorithms Pages http://pauillac.inria.fr/algo/AofA/Problems/index.html
2. S. Albers M. Mitzenmacher Average case analyses of First Fit and Random Fit bin packing Proceedings of the 9th Annual ACM Symposium on Discrete Algorithms 290 299 Proceedings of the 9th Annual ACM Symposium on Discrete Algorithms 1998
3. D.P. Bertsekas J.N. Tsitsiklis Neuro-Dynamic Programming 1996 Athena Scientific Massachusetts
4. E.G. Coffman C. Courcoubetis M.R. Garey D.S. Johnson L.A. McGeoch P.W. Shor R.R. Weber M. Yannakakis Fundamental discrepancies between average-case analyses under discrete and continuous distributions: A bin-packing case study Proceedings of the 23rd Annual ACM Symposium on Theory of Computing 230 240 Proceedings of the 23rd Annual ACM Symposium on Theory of Computing 1991
5. E.G. Coffman M.R. Garey D.S. Johnson Approximation Algorithms for NP-Hard Problems 1996 PWS Publishing Company Boston Approximation algorithms for bin packing: A survey
6. E.G. Coffman D.S. Johnson P.W. Shor R.R. Weber Markov chains, computer proofs and average-case analysis of Best Fit bin packing Proceedings of the 25th Annual ACM Symposium on Theory of Computing 412 421 Proceedings of the 25th Annual ACM Symposium on Theory of Computing 1993
7. D.S. Johnson A. Demers J.D. Ullman M.R. Garey R.L. Graham Worst case performance bounds for simple one-dimensional packing algorithms SIAM Journal on Computing 3 299 325 1974
8. N. Karmakar Probabilistic Analysis of Some Bin-Packing Problems IEEE FOCS 1982 107 111 IEEE FOCS 1982
9. C. Kenyon Y. Rabani A. Sinclair Biased Random Walks, Lyapunov Functions, and Stochastic Analysis of Best Fit Bin Packing Journal of Algorithms 27 2 218 235 1998
10. F.T. Leighton P.W. Shor Tight bounds for minimax grid matching with application to the average case analysis of algorithms Combinatorica 9 161 187 1989
11. J. Mosely P. A. Humblet A class of efficient contention resolution algorithms for multiple access channels IEEE Transactions on Communications 33 2 145 151 1985
12. M. Puterman Markov Decision Processes: Discrete Stochastic Dynamic Programming 1994 John Wiley and Sons New York
13. M. Shaked J. G. Shanthikumar Stochastic Orders and Their Applications 1994 Academic Press, Inc. San Deigo
14. P.W. Shor The average case analysis of some on-line algorithms for bin packing Combinatorica 6 179 200 1986