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...

Full description

Saved in:

Bibliographic Details
Published in:	Theory of computing systems Vol. 63; no. 8; pp. 1757 - 1780
Main Authors:	Balogh, János, Békési, József, Dósa, György, Epstein, Leah, Levin, Asaf
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.11.2019 Springer Nature B.V
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!