In this work we suggest a “refined parameterization” for theVertex Coverproblem using the feedback vertex numberas the parameter, i.e., the size of a smallest vertex set whose deletion turnsGinto a forest. We give a polynomial kernel for the unweighted version ofVertex Coverunder this parame...
This problem is FPT parameterized by the solution size k, with the fastest known algorithm running in time ⁎ due to Cygan [7] after a sequence of improvements.1 CVC also has a classic 2-approximation, implicit in Savage [37]. However, unlike Vertex Cover, CVC was shown to have no ...