Online bin stretching with three bins

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F17%3A10368750" target="_blank" >RIV/00216208:11320/17:10368750 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/s10951-016-0504-y" target="_blank" >http://dx.doi.org/10.1007/s10951-016-0504-y</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s10951-016-0504-y" target="_blank" >10.1007/s10951-016-0504-y</a>

Result language
angličtina
Original language name
Online bin stretching with three bins
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 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 for three bins. Additionally, we present a lower bound of for online bin stretching on three bins and a lower bound of 19/14 for four and five bins that were discovered using a computer search.
Czech name
—
Czech description
—

Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project
<a href="/en/project/GA14-10003S" target="_blank" >GA14-10003S: Restricted computations: Algorithms, models, complexity</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

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

Similar results(10)