Approximation Algorithms for Maximizing the Number of Squares Packed into a Rectangle

We consider the NP-hard problem of packing into a specified rectangle a maximum number of squares from a given set. We define two related approximation algorithms and derive bounds on the worst case performance of the packings they produce.