Parameterized Approximation Scheme for Feedback Vertex Set

Feedback Vertex Set (FVS) is one of the most studied vertex deletion problems in the field of graph algorithms. In the decision version of the problem, given a graph G and an integer k, the question is whether there exists a set S of at most k vertices in G such that G-S is acyclic. It is one of the first few problems which were shown to be NP-complete, and has been extensively studied from the viewpoint of approximation and parameterized algorithms. The best-known polynomial time approximation algorithm for FVS is a 2-factor approximation, while the best known deterministic and randomized FPT algorithms run in time ?^*(3.460^k) and ?^*(2.7^k) respectively. In this paper, we contribute to the newly established area of parameterized approximation, by studying FVS in this paradigm. In particular, we combine the approaches of parameterized and approximation algorithms for the study of FVS, and achieve an approximation guarantee with a factor better than 2 in randomized FPT running time, that improves over the best known parameterized algorithm for FVS. We give three simple randomized (1+?) approximation algorithms for FVS, running in times ?^*(2^{?k}? 2.7^{(1-?)k}), ?^*(({(4/(1+?))^{(1+?)}}?{(?/3)^?})^k), and ?^*(4^{(1-?)k}) respectively for every ? ? (0,1). Combining these three algorithms, we obtain a factor (1+?) approximation algorithm for FVS, which has better running time than the best-known (randomized) FPT algorithm for every ? ? (0, 1). This is the first attempt to look at a parameterized approximation of FVS to the best of our knowledge. Our algorithms are very simple, and they rely on some well-known reduction rules used for arriving at FPT algorithms for FVS