Better Algorithms for Online Bin Stretching via Computer Search

Result code in 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>
Result on the web
<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>

Result language
angličtina
Original language name
Better Algorithms for Online Bin Stretching via Computer Search
Original language description
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.
Czech name
—
Czech description
—

Type
D - Article in proceedings
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/GX19-27871X" target="_blank" >GX19-27871X: Efficient approximation algorithms and circuit complexity</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

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

Similar results(10)