Improved Lower Bound for Online Strip Packing (Extended Abstract)


Harren, Rolf and Kern, Walter (2011) Improved Lower Bound for Online Strip Packing (Extended Abstract). In: Roberto Solis-Oba & Giuseppe Persiano (Eds.), Approximation and Online Algorithms. Lecture Notes in Computer Science, 7164 . Springer, Berlin, Germany, pp. 211-218. ISBN 9783642291166

[img] PDF
Restricted to UT campus only

Abstract:In the two-dimensional strip packing problem a number of rectangles have to be packed without rotation or overlap into a strip such that the height of the strip used is minimal. The width of the rectangles is bounded by 1 and the strip haswidth 1 and infinite height.
Item Type:Book Section
Copyright:© 2011 Springer
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:
Official URL:
Export this item as:BibTeX
HTML Citation
Reference Manager


Repository Staff Only: item control page