Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Stocker, Moritz"'
Autor:
Böckenhauer, Hans-Joachim, Gehnen, Matthias, Hromkovič, Juraj, Klasing, Ralf, Komm, Dennis, Lotze, Henri, Mock, Daniel, Rossmanith, Peter, Stocker, Moritz
We analyze the competitive ratio and the advice complexity of the online unbounded knapsack problem. An instance is given as a sequence of n items with a size and a value each, and an algorithm has to decide how often to pack each item into a knapsac
Externí odkaz:
http://arxiv.org/abs/2407.02045
Autor:
Frei, Fabian, Gehnen, Matthias, Komm, Dennis, Královič, Rastislav, Královič, Richard, Rossmanith, Peter, Stocker, Moritz
Coloring is a notoriously hard problem, and even more so in the online setting, where each arriving vertex has to be colored immediately and irrevocably. Already on trees, which are trivially two-colorable, it is impossible to achieve anything better
Externí odkaz:
http://arxiv.org/abs/2405.18151