Local tree-width, excluded minors, and approximation algorithms

Details Local tree-width, excluded minors, and approximation algorithms Local tree-width, excluded minors, and approximation algorithms

2000-01-24

arxiv.org/abs/math/0001128v1

Mathematics

Combinatorics

Scientific paper

The local tree-width of a graph G=(V,E) is the function ltw^G: N -> N that associates with every natural number r the maximal tree-width of an r-neighborhood in G. Our main graph theoretic result is a decomposition theorem for graphs with excluded minors that essentially says that such graphs can be decomposed into trees of graphs of bounded local tree-width. As an application of this theorem, we show that a number of combinatorial optimization problems, such as 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.

Affiliated with

Also associated with

No associations

Rating

Local tree-width, excluded minors, and approximation algorithms does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Local tree-width, excluded minors, and approximation algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Local tree-width, excluded minors, and approximation algorithms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-729773