Abstract
We study the minimum variant of the online open end bin packing problem. Items are presented one by one, and an item can be packed into a bin while the resulting total size of items excluding the minimum size item of the bin will be below 1. We design an improved online algorithm whose asymptotic competitive ratio does not exceed 1.180952381, and we prove a new lower bound of 1.1666666 on the asymptotic competitive ratio of any online algorithm.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
