Journal of Combinatorial Optimization

, Volume 26, Issue 2, pp 333-344

First online:

Open Access This content is freely available online to anyone, anywhere at any time.

A tight analysis of Brown-Baker-Katseff sequences for online strip packing


We study certain adversary sequences for online strip packing which were first designed and investigated by Brown, Baker and Katseff (Acta Inform. 18:207–225) and determine the optimal competitive ratio for packing such Brown-Baker-Katseff sequences online. As a byproduct of our result, we get a new lower bound of \(\rho \ge 3/2+\sqrt{33}/6 \approx 2.457\) for the competitive ratio of online strip packing.


Online algorithm Strip packing Competitive ratio