Abstract
We study the online strip packing problem and derive an improved lower bound of ??2.589? for the competitive ratio of this problem. The construction is based on modified "Brown-Baker-Katseff sequences" (Brown et al. in Acta Inform. 18:207---225, 1982) using only two types of rectangles. In addition, we present an online algorithm with competitive ratio $(3+\sqrt{5})/2 = 2.618\ldots$ for packing instances of this type.
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.
