A lower bound for online rectangle packing

11/23/2018

∙

by   Leah Epstein, et al.

∙

0

∙

share

We slightly improve the known lower bound on the asymptotic competitive ratio for online bin packing of rectangles. We present a complete proof for the new lower bound, whose value is above 1.91.