A lower bound for online rectangle packing
Abstract
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.