A Two-Phase Algorithm for Bin Stretching with Stretching Factor 1.5
Data Structures and Algorithms
2016-08-23 v2
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. However, our analysis is technically more complicated and uses amortization over the bins with the help of two weight functions.
Keywords
Cite
@article{arxiv.1601.08111,
title = {A Two-Phase Algorithm for Bin Stretching with Stretching Factor 1.5},
author = {Martin Böhm and Jiří Sgall and Rob van Stee and Pavel Veselý},
journal= {arXiv preprint arXiv:1601.08111},
year = {2016}
}
Comments
Preprint of a journal version; updated title and some minor edits. The conference version can be found at arXiv:1404.5569 version 2