In this talk, I introduce the problem and present new approximation algorithms (ESA 2016) that strengthen best-known results. They provide new bounds formulated in terms of the feedback vertex set number r of a graph, which measures its vertex deletion distance to a forest.