Abstract
We consider a multidimensional generalization of the bin packing problem, namely, packing 2−dimensional rectangles into the minimum number of unit squares, where 90 degree rotations are allowed. Our main contribution is a polynomial time algorithm for packing rectangles into at most OPT bins whose sides have length (1+ɛ), for any ɛ>0. Additionally, we show how this result can be used to obtain near optimal packing results for a variety of two and three dimensional packing problems in which 90 degree rotations are allowed. These include minimum rectangle packing, two dimensional strip packing, and the z-oriented 3-dimensional packing problem.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
