Bin packing with discrete item sizes, part I: perfect packing theorems and the average case behavior of optimal packings

SIAM Journal on Discrete Mathematics

Volumn 13, Issue 3, 2000, Pages 384-402

  Coffman Jr , E G ^a,b   Courcoubetis, C ^c   Garey, M R ^b   Johnson, D S ^d   Shor, P W ^d   Weber, R R ^e   Yannakakis, M ^b  

^a NEW JERSEY INSTITUTE OF TECHNOLOGY   (United States)

^b LUCENT TECHNOLOGIES   (United States)

^c ATHENS UNIVERSITY OF ECONOMICS AND BUSINESS   (Greece)

^d AT AND T LABS RESEARCH   (United States)

^e UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

Approximation algorithms; Average case analysis; Bin packing; On line

Indexed keywords

EID: 0010063130     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480197325936     Document Type: Article

References (20)

1. J. L. BENTLEY, D. S. JOHNSON, F. T. LEIGHTON, C C. MCGEOCH, AND L. A. MCGEOCH, Some unexpected expected behavior results for bin packing, in Proceedings of the 16th Annual ACM Symposium on Theory of Computing, ACM, New York, 1984, pp. 279-288.
2. 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, in Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, ACM, New York, 1991, pp. 230-240.
3. E. G. COFFMAN, JR., D. S. JOHNSON, L. A. MCGEOCH, P. W. SHOR, AND R. R. WEBER, Bin Packing with Discrete Item Sizes, Part III: Average Case Behavior of FFD and BFD, in preparation.
4. E. G. COFFMAN, JR., D. S. JOHNSON, P. W. SHOR, AND R. R. WEBER, Bin Packing with Discrete Item Sizes, Part IV: 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 V; Tight Bounds on Best Fit, 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, in Proceedings of the 25th Annual ACM Symposium on Theory of Computing, ACM, New York, 1993, pp. 412-421.
7. E. G. COFFMAN, JR., D. S. JOHNSON, P. W. SHOR, AND R. R. WEBER, Bin packing with discrete item sizes, part II: Tight bounds on first fit, Random Structures Algorithms, 10 (1997), pp. 69-101.
8. E. G. COFFMAN, JR , AND G. S. LUEKER, An Introduction to the Probabilistic Analysis of Packing and Partitioning Algorithms, Wiley, New York, 1991.
9. C. COURCOUBETIS AND R. R. WEBER, Stability of on-line bin packing with random arrivals and long-run average constraints, Probab Engrg. Inform. Sci , 4 (1990), pp. 447-460.
10. J. CSIRIK, D. S. JOHNSON, C. KENYON, J. B ORLIN, P. W. SHOR, AND R. R. WEBER, On the sum-of-squares algorithm for bin packing, in Proceedings of the 32nd ACM Symposium on Theory of Computing, ACM, New York, 2000, to appear.
11. J. CSIRIK, D. S. JOHNSON, C. KENYON, P. W. SHOR, AND R. R. WEBER, A self organizing bin packing heuristic, in Algorithm Engineering and Experimentation, M. Goodrich and C. C. McGeoch, eds., Lecture Notes in Comput. Sci. 1619, Springer-Verlag, Berlin, 1999, pp. 246-265.
12. W. FELLER, An Introduction to Probability Theory and Its Applications, Vol. I, 3rd ed., Wiley, New York, 1968.
13. S. FLOYD AND R M KARP, FFD bin packing for item sizes with distributions on [0, 1/2], Algorithmica, 6 (1991), pp. 222-240.
14. M. R GAREY AND D. S. JOHNSON, Computers and Intractability: A Guide to the Theory of NP-completeness, W. H. Freeman, New York, 1979.
15. C. KENYON, Y. RABANI, AND A. SINCLAIR, Biased random walks, Lyapunov functions, and stochastic analysis of best fit bin packing, in Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, Atlanta, GA, 1996, pp. 351-358.
16. W. KNÖDEL, A bin packing algorithm with complexity o(nlogn) in the stochastic limit, in Proceedings of the 10th Symposium on Mathematical Foundations of Computer Science, J. Gruska and M. Chytil, eds., Lecture Notes in Comput. Sci. 118, Springer-Verlag, Berlin, 1981, pp. 369-378.
17. G. S. LUEKER, An Average-Case Analysis of Bin Packing with Uniformly Distributed Item Sizes, Tech. Report 181, Dept. of Information and Computer Science, University of California, Irvine, CA, 1982.
18. S. P. MEYN AND R. L. TWEEDIE, Markov Chains and Stochastic Stability, Springer-Verlag, Berlin, 1993.
19. P. W. SHOR, The average case analysis of some on-line algorithms for bin packing, Combinatorica, 6 (1986), pp. 179-200.
20. P. W. SHOR, How to pack better than Best Fit: Tight bounds for average-case on-line bin packing, in Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1991, pp. 752-759.