A tight analysis of Brown-Baker-Katseff sequences for online strip packing
W. Kern () and
J. J. Paulus
Additional contact information
J. J. Paulus: CQM BV
Journal of Combinatorial Optimization, 2013, vol. 26, issue 2, No 8, 333-344
Abstract:
Abstract 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.
Keywords: Online algorithm; Strip packing; Competitive ratio (search for similar items in EconPapers)
Date: 2013
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)
Downloads: (external link)
http://link.springer.com/10.1007/s10878-012-9463-1 Abstract (text/html)
Access to the full text of the articles in this series is restricted.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:26:y:2013:i:2:d:10.1007_s10878-012-9463-1
Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878
DOI: 10.1007/s10878-012-9463-1
Access Statistics for this article
Journal of Combinatorial Optimization is currently edited by Thai, My T.
More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().