Skip to main content
Log in

Local Tree-Width, Excluded Minors, and Approximation Algorithms

  • Original Paper
  • Published:
Combinatorica Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Martin Grohe.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Grohe, M. Local Tree-Width, Excluded Minors, and Approximation Algorithms. Combinatorica 23, 613–632 (2003). https://doi.org/10.1007/s00493-003-0037-9

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00493-003-0037-9

Mathematics Subject Classification (2000):

Navigation