论文信息 - Multidimensional On-Line Bin-Packing: An Algorithm and its Average-Case Analysis

Multidimensional On-Line Bin-Packing: An Algorithm and its Average-Case Analysis

Abstract We describe an algorithm for on-line d-dimensional bin packing which achieves O(n (d+1) (d+2) ) average wasted space. This algorithm runs in linear time in the number of items packed.

[1] Prabhakar Raghavan,et al. Multidimensional on-line bin packing: Algorithms and worst-case analysis , 1989 .

[2] Richard M. Karp,et al. A probabilistic analysis of multidimensional bin packing problems , 1984, STOC '84.

[3] Peter W. Shor. The average-case analysis of some on-line algorithms for bin packing , 1986, Comb..

[4] Edward G. Coffman,et al. Probabilistic analysis of packing and partitioning algorithms , 1991, Wiley-Interscience series in discrete mathematics and optimization.

[5] J. Runnenburg. PROBABILITY THEORY AND ITS APPLICATIONS , 1985 .