Optimal Bin Covering with Items of Random Size
暂无分享,去创建一个
Consider a probability measure $\mu $ on $[0,1]$ and independent random variables $X_1 , \cdots ,X_n $ distributed according to $\mu $. Let $Q_n = Q_n (X_1 , \cdots ,X_n )$ be the largest number of unit-size bins that can be covered by items of size $X_1 , \cdots ,X_n $. The properties of $Q_n $ are investigated in the spirit of our work on optimal bin packing with items of random sizes. While the covering problem has many similarities with the packing problem, it turns out to be significantly harder.
[1] Wansoo T. Rhee. Optimal Bin Packing with Items of Random Sizes , 1988, Math. Oper. Res..
[2] Wansoo T. Rhee,et al. Optimal Bin Packing with Items of Random Sizes III , 1989, SIAM J. Comput..
[3] Wansoo T. Rhee,et al. Optimal Bin Packing with Items of Random Sizes II , 1989, SIAM J. Comput..
[4] János Csirik,et al. A probabilistic analysis of the dual bin packing problem , 1986 .
[5] Wansoo T. Rhee,et al. Some distributions that allow perfect packing , 1988, JACM.