EEMCS EPrints Service
Kern, W. and Paulus, J.J. (2009) A note on the lower bound for online strip packing. Memorandum 1893, Department of Applied Mathematics, University of Twente, Enschede. ISSN 1874-4850
Full text available as:
Official URL: http://www.math.utwente.nl/publications/
This note presents a lower bound of 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 (1980). Recently this instance construction is used to improve the lower bound in computer aided proofs. We derive the best possible lower bound that can be obtained with this instance construction.
Export this item as:
To correct this item please ask your editor
Repository Staff Only: edit this item