A lower bound for online rectangle packing

Leah Epstein

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.

Knowledge Graph

arrow_drop_up

Comments

Sign up or login to leave a comment