%0 Journal Article
%T Simple PTAS's for families of graphs excluding a minor
%A Sergio Cabello
%A David Gajser
%J Computer Science
%D 2014
%I arXiv
%R 10.1016/j.dam.2015.03.004
%X 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.
%U http://arxiv.org/abs/1410.5778v2