Search
Now showing items 1-1 of 1
Online Bin Stretching: Algorithms and Computer Lower Bounds
Online Bin Stretching: Algoritmy a strojové dolní odhady
dissertation thesis (DEFENDED)
Advisor: Sgall, Jiří
Date Issued: 2018
Date of defense: 25. 09. 2018
Faculty / Institute: Matematicko-fyzikální fakulta / Faculty of Mathematics and Physics
Abstract: Online Bin Stretching: algoritmy a strojové dolní odhady Autor: Martin Böhm Abstrakt: Zabýváme se problémem v oblasti semi-online algoritmů, který se nazývá Online Bin Stretching. Můžeme tento problém chápat jako pro- blém ...
Online Bin Stretching: Algorithms and Computer Lower Bounds Author: Martin Böhm Abstract: We investigate a problem in semi-online algorithm design, called Online Bin Stretching. The problem can be understood as an online ...
Online Bin Stretching: Algorithms and Computer Lower Bounds Author: Martin Böhm Abstract: We investigate a problem in semi-online algorithm design, called Online Bin Stretching. The problem can be understood as an online ...