Lower Bounds for Several Online Variants of Bin Packing

We consider several previously studied online variants of bin packing and prove new and improved lower bounds on the asymptotic competitive ratios for them. For that, we use a method of fully adaptive constructions. In particular, we improve the lower bound for the asymptotic competitive ratio of on...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Theory of computing systems Jg. 63; H. 8; S. 1757 - 1780
Hauptverfasser:	Balogh, János, Békési, József, Dósa, György, Epstein, Leah, Levin, Asaf
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.11.2019 Springer Nature B.V
Schlagworte:	Asymptotic methods Asymptotic properties Computer Science Lower bounds Special Issue on Approximation and Online Algorithms Theory of Computation Bin packing Online algorithms Lower bounds Competitive ratio
ISSN:	1432-4350, 1433-0490
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!