Abstract
We study the following square packing problem: Given a set Q of squares with positive profits, the goal is to pack a subset of Q into a rectangular bin $\mathcal R$ so that the total profit of the squares packed in $\mathcal R$ is maximized. Squares must be packed so that their sides are parallel to those of $\mathcal R$. We present a polynomial time approximation scheme for the problem, which for any value $\epsilon > 0$ finds and packs a subset $Q' \subseteq Q$ of profit at least $(1-\epsilon) OPT$, where $OPT$ is the profit of an optimum solution.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.