Abstract
The two-dimensional vector packing problem is the generalization of the classical one-dimensional bin packing problem to two dimensions. While an asymptotic polynomial time approximation scheme has been designed for one-dimensional bin packing, the existence of an asymptotic polynomial time approximation scheme for two dimensions would imply P= NP. The existence of an approximation algorithm for the two-dimensional vector packing problem with an asymptotic performance guarantee 2 was an open problem so far. In this paper we present an O(n log n) time algorithm for two-dimensional vector packing with absolute performance guarantee 2.
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.
