66 citations · 457 across the 33 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
cs.DS2022
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…
cs.DS2022★ 3 cited
On data reduction for dynamic vector bin packing
René van Bevern, Andrey Melnikov, Pavel Smirnov +1
We study a dynamic vector bin packing (DVBP) problem. We show hardness for shrinking arbitrary DVBP instances to size polynomial in the number of request types or in the maximal nu…