Simple PTAS's for families of graphs excluding a minor
arXiv:1410.5778 · doi:10.1016/j.dam.2015.03.004
Abstract
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.
To appear in Discrete Applied Mathematics