Approximation schemes via width/weight trade-offs on minor-free graphs

In this paper, we prove a new scaling lemma for vertex weighted minor free graphs that allows for a smooth trade-off between the weight of a vertex set S and the treewidth of G − S. More precisely, we show the following.