2000 character limit reached
A lower bound for online rectangle packing
Published 23 Nov 2018 in cs.DS, cs.DM, math.CO, and math.OC | (1811.09573v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
