  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.
