An 8-approximation algorithm for the subset feedback vertex set problem

We present an 8-approximation algorithm for the problem of finding a minimum weight subset feedback vertex set ( or SUBSET-FVS, in short). The input in this problem consists of an undirected graph G = (V, E) with vertex weights c(v) and a subset of vertices S called special vertices. A cycle is called interesting if it contains at least one special vertex. A subset of vertices is called a SUBSET-FVS with respect to S if it intersects every interesting cycle. The goal is to nd a minimum weight SUBSET-FVS. The best previous algorithm for the general case provided only a logarithmic approximation factor. The minimum weight SUBSET-FVS problem generalizes two NP-complete problems: the minimum weight feedback vertex set problem in undirected graphs and the minimum weight multiway vertex cut problem. The main tool that we use in our algorithm and its analysis is a new version of multicommodity ow, which we call relaxed multicommodity flow. Relaxed multicommodity ow is a hybrid of multicommodity ow and multiterminal flow.