1 citations · 1 across the 3 of their papers we have counts for
3 papers
Learning-Augmented Online Caching: New Upper Bounds
Daniel Skachkov, Denis Ponomaryov, Yuri Dorn +1
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 improv…
A quadratic-order problem kernel for the traveling salesman problem parameterized by the vertex cover number
René van Bevern, Daniel A. Skachkov
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…
Serial and parallel kernelization of Multiple Hitting Set parameterized by the Dilworth number, implemented on the GPU
René van Bevern, Artem M. Kirilin, Daniel A. Skachkov +2
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…