A note on the lower bound for online strip packing

Abstract

This note presents a lower bound of 3/2+ √ 33/6 ≈ 2.457 on the competitive ratio for online strip packing. The instance construction we use to obtain the lower bound was first coined by Brown, Baker and Katseff [2]. Recently this instance construction is used to improve the lower bound in computer aided proofs. We derive the best possible lower bound that… (More)

1 Figure or Table