Abstract
We consider the following rectangle packing problem. Given a set of rectangles, each of which is associated with a profit, we are requested to pack a subset of the rectangles into a bigger rectangle so that the total profit of rectangles packed is maximized. The rectangles may not overlap. This problem is strongly NP-hard even for packing squares with identical profits. We first present a simple (3 + ε)-approximation algorithm. Then we consider a restricted version of the problem and show a (2 + ε)-approximation algorithm. This restricted problem includes the case where rotation by 90° is allowed (and is possible), and the case of packing squares. We apply a similar technique to the general problem, and get an improved algorithm with a worst-case ratio of at most 5/2 + ε. Finally, we devise a (2 + ε)-approximation algorithm for the general problem.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding authors
Rights and permissions
About this article
Cite this article
Jansen, K., Zhang, G. Maximizing the Total Profit of Rectangles Packed into a Rectangle. Algorithmica 47, 323–342 (2007). https://doi.org/10.1007/s00453-006-0194-5
Issue Date:
DOI: https://doi.org/10.1007/s00453-006-0194-5