Local Tree-Width, Excluded Minors, and Approximation Algorithms
- Cite this article as:
- Grohe, M. Combinatorica (2003) 23: 613. doi:10.1007/s00493-003-0037-9
- 172 Downloads
The local tree-width of a graph G=(V,E) is the function ltwG :ℕ→ℕ 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.