Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
162 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

A lower bound for online rectangle packing (1811.09573v1)

Published 23 Nov 2018 in cs.DS, cs.DM, math.CO, and math.OC

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.

Citations (6)

Summary

We haven't generated a summary for this paper yet.