Better Algorithms for Online Bin Stretching

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F15%3A10316487" target="_blank" >RIV/00216208:11320/15:10316487 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/978-3-319-18263-6_3" target="_blank" >http://dx.doi.org/10.1007/978-3-319-18263-6_3</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-319-18263-6_3" target="_blank" >10.1007/978-3-319-18263-6_3</a>

Result language
angličtina
Original language name
Better Algorithms for Online Bin Stretching
Original language description
Online Bin Stretching is a semi-online variant of bin packing in which the algorithm has to use the same number of bins as the 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 also show a specialized algorithm for three bins with a stretching factor of 11/8 = 1.375.
Czech name
—
Czech description
—

Project
<a href="/en/project/GA14-10003S" target="_blank" >GA14-10003S: Restricted computations: Algorithms, models, complexity</a><br>
Continuities
S - Specificky vyzkum na vysokych skolach<br>I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year
2015
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)