Abstract
In λ-packing items are grouped in batches. Items arrive one by one (online) and they are stored in a buffer until either the total volume of stored items is greater than or equal to λ or all items have already arrived. Then items from the buffer are packed offline into a unit capacity bin and the buffer is emptied. We show that any sequence of squares with total area not greater than 1/2 can be 1/4-packed into a single bin (a unit square).
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.
