论文信息 - Probabilistic Analysis for Simple One- and Two-Dimensional Bin Packing Algorithms - 字舞流文

Probabilistic Analysis for Simple One- and Two-Dimensional Bin Packing Algorithms

Greg N. Frederickson | G. Frederickson

[1] Stephen D. Shapiro,et al. Performance of Heuristic Bin Packing Algorithms with Segments of Random Length , 1977, Inf. Control..

[2] Andrew Chi-Chih Yao,et al. New Algorithms for Bin Packing , 1978, JACM.

[3] Micha Hofri. Two-Dimensional Packing: Expected Performance of Simple Level Algorithms , 1980, Inf. Control..

[4] David S. Johnson,et al. Fast Algorithms for Bin Packing , 1974, J. Comput. Syst. Sci..

[5] David S. Johnson,et al. Approximation algorithms for combinatorial problems: an annotated bibliography , 1976 .

[6] William Feller,et al. An Introduction to Probability Theory and Its Applications , 1951 .

[7] Micha Hofri,et al. A Stochastic Model of Bin-Packing , 1980, Inf. Control..

[8] Ronald L. Rivest,et al. Orthogonal Packings in Two Dimensions , 1980, SIAM J. Comput..

[9] Jeffrey D. Ullman,et al. Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms , 1974, SIAM J. Comput..