- No file added yet -
A Two-Phase Algorithm for Bin Stretching with Stretching Factor 1.5
journal contribution
posted on 2016-04-08, 09:22 authored 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.
Funding
Supported by the project 14-10003S of GA ČR and by the GAUK project 548214.
History
Citation
Journal of Combinatorial Optimization, 2017Author affiliation
/Organisation/COLLEGE OF SCIENCE AND ENGINEERING/Department of Computer ScienceVersion
- AM (Accepted Manuscript)
Published in
Journal of Combinatorial OptimizationPublisher
Springerissn
1382-6905eissn
1573-2886Available date
2016-04-08Publisher DOI
Publisher version
https://link.springer.com/article/10.1007/s10878-017-0114-4Notes
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’.Language
enAdministrator link
Usage metrics
Categories
No categories selectedLicence
Exports
RefWorks
BibTeX
Ref. manager
Endnote
DataCite
NLM
DC