论文信息 - Inequalities for bin packing-III

Inequalities for bin packing-III

Consider the minimum number of unit size bins needed to pack Items that are independently distributed according to a given distribution μ concentrated on [0,1]. We prove that for some universal constant $i;K$ei;. we have

Wansoo T. Rhee

[1] Wansoo T. Rhee. Inequalities for Bin Packing - II , 1993, Math. Oper. Res..

[2] Wansoo T. Rhee. A Note on Optimal Bin Packing and Optimal Bin Covering with Items of Random Size , 1990, SIAM J. Comput..

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

[4] Wansoo T. Rhee,et al. Martingale Inequalities and NP-Complete Problems , 1987, Math. Oper. Res..

[5] W. Hoeffding. Probability Inequalities for sums of Bounded Random Variables , 1963 .

[6] Some inequalities for bin packing , 1989 .