Zobrazeno 1 - 10
of 99
pro vyhledávání: '"Komm, Dennis"'
With the large diversity of platforms and devices used by students, web applications increasingly suggest themselves as the solution of choice. Developing adequate educational programming environments in the browser, however, remains a challenge and
Externí odkaz:
http://arxiv.org/abs/2410.07001
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
Can we efficiently compute optimal solutions to instances of a hard problem from optimal solutions to neighboring (i.e., locally modified) instances? For example, can we efficiently compute an optimal coloring for a graph from optimal colorings for a
Externí odkaz:
http://arxiv.org/abs/1906.10078
The online search problem is a fundamental problem in finance. The numerous direct applications include searching for optimal prices for commodity trading and trading foreign currencies. In this paper, we analyze the advice complexity of this problem
Externí odkaz:
http://arxiv.org/abs/1612.09299
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Several well-studied graph problems aim to select a largest (or smallest) induced subgraph with a given property of the input graph. Examples of such problems include maximum independent set, maximum planar graph, and many others. We consider these p
Externí odkaz:
http://arxiv.org/abs/1512.05996
We study the relationship between the competitive ratio and the tail distribution of randomized online minimization problems. To this end, we define a broad class of online problems that includes some of the well-studied problems like paging, k-serve
Externí odkaz:
http://arxiv.org/abs/1302.2805
Autor:
Böckenhauer, Hans-Joachim, Komm, Dennis, Královič, Rastislav, Královič, Richard, Mömke, Tobias
Publikováno v:
In Information and Computation June 2017 254 Part 1:59-83