Local Tree-Width, Excluded Minors, and Approximation Algorithms

The local tree-width of a graph G=(V,E) is the function ltw^G :ℕ→ℕ that associates with every r∈ℕ the maximal tree-width of an r-neighborhood in G. Our main grapht heoretic result is a decomposition theorem for graphs with excluded minors, which says that such graphs can be decomposed into trees of graphs of almost bounded local tree-width.

As an application of this theorem, we show that a number of combinatorial optimization problems, suchas Minimum Vertex Cover, Minimum Dominating Set, and Maximum Independent Set have a polynomial time approximation scheme when restricted to a class of graphs with an excluded minor.

Authors and Affiliations

1. Humboldt-Universität zu Berlin, Institut für Informatik, Unter den Linden 6, 10099, Berlin, Germany

   Martin Grohe

Corresponding author

Correspondence to Martin Grohe.

Reprints and permissions