• Corpus ID: 446986

The Best Two-Phase Algorithm for Bin Stretching

@article{Bhm2016TheBT,
  title={The Best Two-Phase Algorithm for Bin Stretching},
  author={Martin B{\"o}hm and Jir{\'i} Sgall and Rob van Stee and Pavel Vesel{\'y}},
  journal={ArXiv},
  year={2016},
  volume={abs/1601.08111}
}

• Martin Böhm, J. Sgall, +1 author P. Veselý
• Published 29 January 2016
• Computer Science
• ArXiv

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.