Better Algorithms for Online Bin Stretching via Computer Search

Kód výsledku v IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F24%3A10493601" target="_blank" >RIV/00216208:11320/24:10493601 - isvavai.cz</a>
Výsledek na webu
<a href="https://doi.org/10.1007/978-3-031-55598-5_16" target="_blank" >https://doi.org/10.1007/978-3-031-55598-5_16</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-031-55598-5_16" target="_blank" >10.1007/978-3-031-55598-5_16</a>

Jazyk výsledku
angličtina
Název v původním jazyce
Better Algorithms for Online Bin Stretching via Computer Search
Popis výsledku v původním jazyce
ONLINE BIN STRETCHING is a problem closely related to ONLINE BIN PACKING and various scheduling problems. There is extensive history of computer search being used to establish lower bounds for this problem by identifying difficult sets of inputs. We demonstrate a novel approach enabling the use of computer search for finding new algorithms and therefore upper bounds for this problem. This not only leads to improved results for ONLINE BIN STRETCHING, but also shows that computer search can be used to find new algorithms, even for problems that might not appear suitable for this approach.
Název v anglickém jazyce
Better Algorithms for Online Bin Stretching via Computer Search
Popis výsledku anglicky
ONLINE BIN STRETCHING is a problem closely related to ONLINE BIN PACKING and various scheduling problems. There is extensive history of computer search being used to establish lower bounds for this problem by identifying difficult sets of inputs. We demonstrate a novel approach enabling the use of computer search for finding new algorithms and therefore upper bounds for this problem. This not only leads to improved results for ONLINE BIN STRETCHING, but also shows that computer search can be used to find new algorithms, even for problems that might not appear suitable for this approach.

Druh
D - Stať ve sborníku
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/GX19-27871X" target="_blank" >GX19-27871X: Efektivní aproximační algoritmy a obvodová složitost</a><br>
Návaznosti
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění
2024
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)