A new lower bound for online strip packing ?
We derive a new improved lower bound of 2.618 for the competitive ratio for the online strip packing. This result improves the best known lower bound of 2.589. We also show that 2.618 is the best lower bound which can be obtained by our adversary sequences.
strip packing packing competitive ratio online algorithm