28 citations · 71 across the 13 of their papers we have counts for
Showing 2021Show all
3 papers · 1 filter
cs.DS2021
Generating faster algorithms for d-Path Vertex Cover
Radovan Červený, Ondřej Suchý
Many algorithms which exactly solve hard problems require branching on more or less complex structures in order to do their job. Those who design such algorithms often find themsel…
cs.DS2021
Constant Factor Approximation for Tracking Paths and Fault Tolerant Feedback Vertex Set
Václav Blažej, Pratibha Choudhary, Dušan Knop +3
Consider a vertex-weighted graph with a source and a target . Tracking Paths requires finding a minimum weight set of vertices (trackers) such that the sequence of track…
cs.DS2021
On Kernels for d-Path Vertex Cover
Radovan Červený, Pratibha Choudhary, Ondřej Suchý
In this paper we study the kernelization of the -Path Vertex Cover (-PVC) problem. Given a graph , the problem requires finding whether there exists a set of at most v…