  We show that a simple local search gives a PTAS for the Feedback Vertex Set
(FVS) problem in minor-free graphs. An efficient PTAS in minor-free graphs was
known for this problem by Fomin, Lokshtanov, Raman and Sauraubh. However, their
algorithm is a combination of many advanced algorithmic tools such as
contraction decomposition framework introduced by Demaine and Hajiaghayi,
Courcelle's theorem and the Robertson and Seymour decomposition. In stark
contrast, our local search algorithm is very simple and easy to implement. It
keeps exchanging a constant number of vertices to improve the current solution
until a local optimum is reached. Our main contribution is to show that the
local optimum only differs the global optimum by $(1+\epsilon)$ factor.
