Optimization problems in multiple subtree graphs ?
We study various optimization problems in t-subtree graphs , the intersection graphs of t t -subtrees, where a t t -subtree is the union of t t disjoint subtrees of some tree. This graph class generalizes both the class of chordal graphs and the class of t t -interval graphs, a generalization of interval graphs that has recently been studied from a combinatorial optimization point of view. We present approximation algorithms for the Maximum Independent Set, Minimum Coloring, Minimum Vertex Cover, Minimum Dominating Set, and Maximum Cliqueproblems.
multiple subtree graphs approximation algorithms maximum independent set minimum coloring minimum vertex cover minimum dominating set maximum clique