Bin Packing with Discrete Item Sizes, Part II: Tight Bounds on First Fit

Random Structures and Algorithms

Volumn 10, Issue 1-2, 1997, Pages 69-101

  Coffman Jr , E G ^a   Johnson, D S ^b   Shor, P W ^b   Weber, R R ^c  

^a LUCENT TECHNOLOGIES   (United States)

^b AT AND T LABS RESEARCH   (United States)

^c UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031538003     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/(sici)1098-2418(199701/03)10:1/2<69::aid-rsa4>3.0.co;2-v     Document Type: Article

References (11)

1. 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, Proc. 23rd Annual ACM Symposium on Theory of Computing, 1991, ACM Press, New York, pp. 230-240.
2. E. G. Coffman, Jr., C. Courcoubetis, M. R. Garey, D. S. Johnson, P. W. Shor, R. R. Weber, and M. Yannakakis, Bin packing with discrete item sizes, Part I: Perfect packing theorems and the average case behavior of optimal packings, in preparation.
3. E. G. Coffman, Jr., D. S. Johnson, P. W. Shor, and R. R. Weber, Bin packing with discrete item sizes, Part III; Tight bounds on Best Fit, in preparation.
4. E. G. Coffman, Jr., D. S. Johnson, P. W. Shor, and R. R. Weber, Bin packing with discrete item sizes, Part V: Markov chains, computer proofs, and average-case analysis of Best Fit bin packing, in preparation.
5. E. G. Coffman, Jr., D. S. Johnson, P. W. Shor, and R. R. Weber, Bin packing with discrete item sizes, Part IV: Average case behavior of FFD and BFD, in preparation.
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 Annual ACM Symposium on Theory of Computing, 1993, ACM Press, New York, pp. 412-421.
7. W. Feller, An Introduction to Probability Theory and Its Applications, Vol. II, Wiley, New York, 1966.
8. C. Kenyon, Y. Rabani, and A. Sinclair, Biased random walks, Lyapunov functions, and stochastic analysis of best fit bin packing, Proc. Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 1996, Society for Industrial and Applied Mathematics, Philadelphia, pp. 351-358.
9. S. M. Ross, Introduction to Stochastic Dynamic Programming, Academic Press, New York, 1983.
10. P. W. Shor, The average case analysis of some on-line algorithms for bin packing, Combinatorica, 6, 179-200 (1986).
11. P. W. Shor, How to pack better than Best Fit: tight bounds for average-case on-line bin packing, 32nd Annual Symposium on Foundations of Computer Science, 1991, IEEE, New York, pp. 752-759.