Algorithms for Square Packing: A Probabilistic Analysis

This paper makes a probabilistic performance analysis of simple algorithms to pack a list Ln of n squares into a strip or a set of bins. We assume that the squares sizes are drawn independently from the uniform distribution on [0,1].