Average-case analyses of first fit and random fit bin packing

Random Structures and Algorithms

Volumn 16, Issue 3, 2000, Pages 240-259

  Albers, Susanne ^a,c   Mitzenmacher, Michael ^b  

^a TU DORTMUND UNIVERSITY   (Germany)

^b Max Planch Inst für Informatik ^*  (United States)

^c MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0034344102     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1098-2418(200005)16:3<240::AID-RSA2>3.0.CO;2-V     Document Type: Article

References (15)

1. Y. Azar, A. Broder, A. Karlin, and E. Upfal, Balanced allocations, Proc Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994, pp. 593-602.
2. E.G. Coffman, 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 Twenty-Third Annual ACM Symposium on Theory of Computing, 1991, pp. 230-240.
3. 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. Hochbaum (Editor), PWS, Boston, 1996.
4. 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 Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993, pp. 412-421.
5. G. Fayolle, V.A. Malyeshev, and M.V. Menshikov, Topics in constructive theory of countable Markov chains, Cambridge Univ. Press, Cambridge, U.K., 1995.
6. B. Hajek, Hitting-time and occupation-time bounds implied by drift analysis with applications, Adv App Probab 14 (1982), 502-525.
7. D.S. Johnson, Near-optimal bin packing algorithms, Ph.D. thesis, Department of Mathematics, Massachusetts Institute of Technology, 1973.
8. D.S. Johnson, Fast algorithms for bin packing, J Comput. Syst Sci 8 (1974), 272-314.
9. D.S. Johnson, A. Demers, J.D. Ullman, M.R. Garey, and R.L. Graham, Worst case bounds for simple one-dimensional packing algorithms, SIAM J Comput 3 (1974), 299-325.
10. C. Kenyon, A. Sinclair, and Y. Rabani, Biased random walks, Lyapunov functions, and stochastic analysis of Best Fit bin packing, Proc Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 1995, pp. 351-358.
11. N. Kahale, Large deviation bounds for Markov chains, DIMACS Technical Report 1994, pp. 94-39.
12. T. Leighton and P. Shor, Tight bounds for minimax grid matching with applications to average case analysis of algorithms, Combinatorica 9 (1989), 161-187.
13. S. Meyn and R. Tweedie, Markov chains and stochastic stability, Springer-Verlag, Berlin/New York, 1996.
14. M. Mitzenmacher, Load balancing and density dependent jump Markov processes, Proc Thirty-Seventh IEEE Annual Symposium on Foundations of Computer Science, 1996, pp. 213-222.
15. P.W. Shor, The average-case analysis of some on-line algorithms for bin packing, Combinatorica 6 (1986), 179-200.