Please use this identifier to cite or link to this item:
|Title:||A Two-Phase Algorithm for Bin Stretching with Stretching Factor 1.5|
Van Stee, Rob
|Citation:||Journal of Combinatorial Optimization, 2017|
|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.|
|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: http://creativecommons.org/licenses/by-nc-nd/4.0/|
|Description:||The 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’.
|Appears in Collections:||Published Articles, Dept. of Computer Science|
Files in This Item:
|1601.08111v2.pdf||Post-print||409.74 kB||Adobe PDF||View/Open|
Items in LRA are protected by copyright, with all rights reserved, unless otherwise indicated.