Tight Bounds for Restricted Grid Scheduling
Int. J. Found. Comput. Sci., 2019.
The following online bin packing problem is considered: Items with integer sizes are given and variable sized bins arrive online. A bin must be used if there is still an item remaining which fits in it when the bin arrives. The goal is to minimize the total size of all the bins used. Previously, a lower bound of 5/4 on the competitive rat...More
Full Text (Upload PDF)
PPT (Upload PPT)