Abstract
Consider three colors 1,2,3, and forj≤3, considern items (X i,j)i≤n of colorj. We want to pack these items inn bins of equal capacity (the bin size is not fixed, and is to be determined once all the objects are known), subject to the condition that each bin must contain exactly one item of each color, and that the total item sizes attributed to any given bin does not exceed the bin capacity. Consider the stochastic model where the random variables (X i,jj)i≤n,j≤3 are independent uniformly distributed over [0,1]. We show that there is a polynomial-time algorithm that produces a packing which has a wasted space≤K logn with overwhelming probability.
Similar content being viewed by others
References
E. G. Coffman, Jr., andM. Yannakakis: Permuting elements within columns of a matrix in order to minimize maximum row sum,Math. of Operation Research 9 (1984), 384–390.
W. Rhee: A note on optimal bin packing and bin covering with items of random sizesSIAM J. of Computing 19 (1990), 705–710.
W. Rhee, andM. Talagrand: Optimal bin packing with items of random sizes III,SIAM J. of Computing 18 (1989), 473–486.
V. Strassen: The existence of probability measures with given marginals,Ann. Math. Stat. 35 (1965), 423–439.
Author information
Authors and Affiliations
Additional information
Work partially supported by an N.S.F. grant.