Markov chains, computer proofs, and average-case analysis of best fit bin packing

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F129585, Issue , 1993, Pages 412-421

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

^a Information Sciences Research Center AT and T Laboratories   (United States)

^b UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

BINS; CHAINS; COMPUTATION THEORY; COMPUTER AIDED ANALYSIS; COMPUTER PROGRAMMING; DIGITAL ARITHMETIC; LINEAR PROGRAMMING; ALGORITHMS; DATA PROCESSING; DYNAMIC PROGRAMMING; FUNCTION EVALUATION; MATHEMATICAL MODELS; ONLINE SEARCHING; STATISTICAL METHODS; THEOREM PROVING;

AVERAGE-CASE ANALYSIS; AVERAGE-CASE BEHAVIOR; BIN PACKING ALGORITHM; COMPUTER AIDED-APPROACH; LINEAR PROGRAMMING PACKAGES; MULTI-DIMENSIONAL MARKOV CHAINS; THEORETICAL TECHNIQUE; UNIFORM DISTRIBUTION;

MARKOV PROCESSES; FINITE AUTOMATA;

BEST FIT BIN PACKING; COMPUTER PROOFS; MARKOV CHAINS; ONLINE ALGORITHMS;

EID: 0027150672     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/167088.167203     Document Type: Conference Paper

References (21)

1. IEEE Standard for Binary Floating-Point Arithmetic, ANSI/IEEE Std 754-1985, Institute for Electrical and Electronic Engineers, Inc., New York, 1985.
2. J. L. Bentley, D. S. Johnson, F. T. Lhghton, and C. C. McGeoch, "An experimental study of bin packing, " in Proc. 21st Arm. AUerton Conf. on Communication, Control, and Computing, University of Illinois, Urbana, IL, 1983, 5160.
3. 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 16th Ann. ACM Symp. on Theory of Computing, Association for Computing Machinery, New York, 1984, 279-288.
4. E. G. Coffman Jr. C. Courcoubetis, M. R. Garey, D. S. Johnson, L. A. McGeoch, P. W. Shor, R. R. Weber, and M. Yannakahs, "Fundamental discrepancies between average-case analyses under discrete and continuous distributions: A bin packing case study, " in Proceedings 23rd Ann. ACM Symp. on Theory of Computing, Association for Computing Machinery, New York, 1991, 230-240.
5. E. G. Coffman Jr, M. Hofri, K. So, and A. C. Yao, "A stochastic model of bin packing, " Information and Control 44 (1980), 105-115.
6. E. G. Coffman Jr and G. S. Lueker, Probabilistic Analysis of Packing and Partitioning, Wiley & Sons, New York, 1991.
7. G. Fayolle, "On random walks arising in queueing systems: Ergodicity and transience via quadratic forms as Lyapounov Functions - Part I, " Queueing Systems 5 (1989), 167-184.
8. G. N. frederickson, "Probabilistic analysis for simple one-And two-dimensional bin packing algorithms, " Ittform. Process. Lett. 11 (1980), 156-161.
9. B. Hajek, "Hitting-Time and occupation-Time bounds implied by drift analysis with applications, " Adv. Appl. Prob. 14 (1982), 502-525.
10. 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. Com-put. 3 (1974), 299-325.
11. A. R. Karlin, S. J. Phillips, and P. Raghavan, "Markov paging, " in Proceedings 33rd Ann. Symp. on Foundations of Computer Science, ' IEEE Computer Society, Los Angeles, Calif., 1992, 208-217.
12. N. karmarkar, "Probabilistic analysis of some bin-packing algorithms, " in Proceedings 23rd Ann. Symp. on Foundations of Computer Science, ' IEEE Computer Society, Los Angeles, Calif., 1982, 107-111.
13. W. kncdel, "A bin packing algorithm with complexity O(nlogn) and performance 1 in the stochastic limit, " in Proc. 10th Symp. on Mathematical Foundations of Computer Science, J. Gruska and M. Chytil (eds.), Lecture Notes in Computer Science 118, Springer-Verlag, 1981, 369-378.
14. H. kushner, Introduction to Stochastic Control, Holt, Rine- hart and Winston, Inc., New York, 1971.
15. G. S. lueker, "An average-case analysis of bin packing with uniformly distributed item sizes, " Report No. 181, Department of Information and Computer Science, University of California, Irvine, CA, 1982.
16. V. A. malyshev, "Classification of two-dimensional positive random walks and almost-linear semi-martingales;, " Soviet Math. Dokl. 13(1972), 136-139.
17. V. A. malyshev and M. V. menshikov, "Ergodicity, continuity and analyticity of countable Markov chains, " Trudi. Moscow Matem. Obshch 39 (1979), in Russian. English ver-sion in Trans. Moscow Math. Soc., Issue 1 (1979), 1-48.
18. M. V. menshikov, "Ergodicity and transience conditions for random walks in the positive octant of space, " Soviet Math. Dokl. 15 (1979).
19. P. W. Shor, "The average case analysis of some on-line algorithms for bin packing, " Combinatorica 6 (1986), 179200.
20. P. W. Shor, "How to do better than best fit: Tight bounds for average-case on-line bin packing, " in Proceedings 32nd Ann. Symp. on Foundations of Computer Science, ' IEEE Computer Society, Los Angeles, Calif., 1990, 752-759.
21. J. S. Vriter and P. Krishnan, "Optimal prefetching via data compression, " in Proceedings 32nd Ann. Symp. on Foundations of Computer Science, ' IEEE Computer Society, Los Angeles, Calif., 1991, 121-130.