Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Skachkov, Daniel A."'
We address the problem of learning-augmented online caching in the scenario when each request is accompanied by a prediction of the next occurrence of the requested page. We improve currently known bounds on the competitive ratio of the BlindOracle a
Externí odkaz:
http://arxiv.org/abs/2410.01760
Autor:
van Bevern, René, Skachkov, Daniel A.
The NP-hard graphical traveling salesman problem (GTSP) is to find a closed walk of total minimum weight that visits each vertex in an undirected edge-weighted and not necessarily complete graph. We present a problem kernel with $\tau^2+\tau$ vertice
Externí odkaz:
http://arxiv.org/abs/2207.08678
Autor:
van Bevern, René, Kirilin, Artem M., Skachkov, Daniel A., Smirnov, Pavel V., Tsidulko, Oxana Yu.
Publikováno v:
Journal of Computer and System Sciences 139:103479, 2024
The NP-hard Multiple Hitting Set problem is finding a minimum-cardinality set intersecting each of the sets in a given input collection a given number of times. Generalizing a well-known data reduction algorithm due to Weihe, we show a problem kernel
Externí odkaz:
http://arxiv.org/abs/2109.06042
Autor:
van Bevern, René, Kirilin, Artem M., Skachkov, Daniel A., Smirnov, Pavel V., Tsidulko, Oxana Yu.
Publikováno v:
In Journal of Computer and System Sciences February 2024 139
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.