Improved Lower Bound for Online Strip Packing

Improved Lower Bound for Online Strip Packing

We study the online strip packing problem and derive an improved lower bound of ρ ≥2.589… for the competitive ratio of this problem. The construction is based on modified “Brown-Baker-Katseff sequences” (Brown et al. in Acta Inform. 18:207–225, 1982 ) using only two types of rectangles. In addition,...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Theory of computing systems 2015-01, Vol.56 (1), p.41-72
Hauptverfasser: Harren, Rolf, Kern, Walter
Format: Artikel
Sprache:eng
Schlagworte:
Algorithms
Analysis
Approximation
Competition
Computation
Computer Science
Construction
Lower bounds
Online
Packing problem
Performance evaluation
Rectangles
Strip
Studies
Texts
Theory of Computation
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We study the online strip packing problem and derive an improved lower bound of ρ ≥2.589… for the competitive ratio of this problem. The construction is based on modified “Brown-Baker-Katseff sequences” (Brown et al. in Acta Inform. 18:207–225, 1982 ) using only two types of rectangles. In addition, we present an online algorithm with competitive ratio for packing instances of this type.
ISSN:1432-4350
1433-0490
DOI:10.1007/s00224-013-9494-8