论文信息 - Online algorithms for a dual version of bin packing

Online algorithms for a dual version of bin packing

Abstract It is shown that for the dual version of bin packing defined by Assmann et al. no online algorithm can have a performance ratio better than 1 2 . For uniformly distributed elements we give an asymptotically optimal algorithm.

János Csirik | V. Totik

[1] János Csirik,et al. A probabilistic analysis of the dual bin packing problem , 1986 .

[2] V. V. Petrov. Sums of Independent Random Variables , 1975 .

[3] Frank M. Liang. A Lower Bound for On-Line Bin Packing , 1980, Inf. Process. Lett..

[4] Joseph Y.-T. Leung,et al. On a Dual Version of the One-Dimensional Bin Packing Problem , 1984, J. Algorithms.