Simple PTAS's for families of graphs excluding a minor
  We show that very simple algorithms based on local search are polynomial-time approximation schemes for Maximum Independent Set, Minimum Vertex Cover and Minimum Dominating Set, when the input graphs have a fixed forbidden minor. 
Sergio Cabello, David Gajser
cs.DS cs.DM