journal contribution posted on 08.04.2016, 09:22 by Martin Böhm, Jiří Sgall, Rob Van Stee, Pavel Veselý
Online Bin Stretching is a semi-online variant of bin packing in which the algorithm has to use the same number of bins as an optimal packing, but is allowed to slightly overpack the bins. The goal is to minimize the amount of overpacking, i.e., the maximum size packed into any bin. We give an algorithm for Online Bin Stretching with a stretching factor of $1.5$ for any number of bins. We build on previous algorithms and use a two-phase approach. We also show that this approach cannot give better results by proving a matching lower bound.
Supported by the project 14-10003S of GA ČR and by the GAUK project 548214.
CitationJournal of Combinatorial Optimization, 2017
Author affiliation/Organisation/COLLEGE OF SCIENCE AND ENGINEERING/Department of Computer Science
VersionAM (Accepted Manuscript)
Published inJournal of Combinatorial Optimization
NotesThe conference version can be found at arXiv:1404.5569;An erratum to this article is available at http://dx.doi.org/10.1007/s10878-017-0116-2.;The original version of this article was revised: The original title of this article is “A two-phase algorithm for bin stretching with 4 stretching factor 1.5”. The title was inadvertently changed to “A two-phase algorithm 5 for bin stretching with stretching factor 1:5’.