Approximability of the independent feedback vertex set problem for bipartite graphs

•We analyze the approximability of the independent feedback vertex set problem.•The problem is hard to approximate on planar bipartite graphs.•There is an efficient approximation algorithm for bipartite graphs of bounded maximum degree.•The problem is solvable in polynomial time if a given bipartite graph is of maximum degree three.