A two-phase algorithm for bin stretching with stretching factor 1.5

Kód výsledku v IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F17%3A10368752" target="_blank" >RIV/00216208:11320/17:10368752 - isvavai.cz</a>
Výsledek na webu
<a href="http://dx.doi.org/10.1007/s10878-017-0114-4" target="_blank" >http://dx.doi.org/10.1007/s10878-017-0114-4</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s10878-017-0114-4" target="_blank" >10.1007/s10878-017-0114-4</a>

Jazyk výsledku
angličtina
Název v původním jazyce
A two-phase algorithm for bin stretching with stretching factor 1.5
Popis výsledku v původním jazyce
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.
Název v anglickém jazyce
A two-phase algorithm for bin stretching with stretching factor 1.5
Popis výsledku anglicky
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.

Druh
J<sub>imp</sub> - Článek v periodiku v databázi Web of Science
CEP obor
—
OECD FORD obor
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt
<a href="/cs/project/GA14-10003S" target="_blank" >GA14-10003S: Omezené typy výpočtů: algoritmy, modely, složitost</a><br>
Návaznosti
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění
2017
Kód důvěrnosti údajů
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Podobné výsledky(10)