Please use this identifier to cite or link to this item:
Title: The Best Two-Phase Algorithm for Bin Stretching
Authors: Böhm, M.
Sgall, J.
Van Stee, Rob
Veselý, P.
First Published: 2016
Publisher: Springer
Citation: Journal of Combinatorial Optimization, 2016 (Submitted)
Abstract: 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.
ISSN: 1382-6905
eISSN: 1573-2886
Links: TBA
Version: Pre-print
Type: Journal Article
Rights: The file attached to this record is distributed under the Creative Commons “Attribution Non-Commercial No Derivatives” licence, further details of which can be found via the following link:
Description: Preprint of a journal version. The conference version can be found at arXiv:1404.5569
Appears in Collections:Published Articles, Dept. of Computer Science

Files in This Item:
File Description SizeFormat 
1601.08111v1.pdfPre-review (submitted draft)380.43 kBAdobe PDFView/Open

Items in LRA are protected by copyright, with all rights reserved, unless otherwise indicated.