Suppose we have a sequence of n objects 41,42,---, Un where each a; has size si. We wish to store these objects in buckets such that the objects in each bucket are consecutive members of the sequence. Assume that we have buckets of k different sizes 11, ..., such that n buckets are available for each size. The cost of any bucket is proportional to its size. The objects 4j+1, Q3+2, ,0j+s fit into a bucket of size 1, if and only if its 8 2. Suppose we have a sequence of n objects 41,42,---, Un where each a; has size si. We wish to store these objects in buckets such that the objects in each bucket are consecutive members of the sequence. Assume that we have buckets of k different sizes 11, ..., such that n buckets are available for each size. The cost of any bucket is proportional to its size. The objects 4j+1, Q3+2, ,0j+s fit into a bucket of size 1, if and only if its 8 2