On rectangle packing: maximizing benefits

@inproceedings{Jansen2004OnRP,
  title={On rectangle packing: maximizing benefits},
  author={Klaus Jansen and Guochuan Zhang},
  booktitle={SODA},
  year={2004}
}
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 to maximize the total profit of rectangles packed. The rectangles may not overlap and may or may not be rotated. This problem is strongly NP-hard even for packing squares with identical profits. A simple (3 + ε)-approximation algorithm is presented. We further improve the algorithm by showing a… CONTINUE READING

From This Paper

Figures, tables, results, connections, and topics extracted from this paper.
43 Extracted Citations
0 Extracted References
Similar Papers

Citing Papers

Publications influenced by this paper.
Showing 1-10 of 43 extracted citations

Similar Papers

Loading similar papers…