Further results on a problem of Knödel concerning the analysis of bin-packing

Abstract. Assume that inputs of size $\frac 14$, $\frac 24$, $\frac 34$, or 1 might occur with equal probabilities. If they are put into boxes of size 1 by the strategy {\it best fit}, there remains some {\it empty space}. This quantity has been evaluated asymptotically for $n$ {\it random insertions}.

This paper is available in the Tex, Dvi, and PostScript format.
(Back to List of Papers)