Optimization problems in multiple subtree graphs

We study various optimization problems in t-subtree graphs, the intersection graphs of tsubtrees, where a t-subtree is the union of t disjoint subtrees of some tree. This graph class generalizes both the class of chordal graphs and the class of 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 Clique problems.

• Type: Journal
• Year: 2011
• Where: DAM
• Authors: Danny Hermelin, Dror Rawitz
• Keywords: DAM 2011, Intersection Graphs, Minimum Dominating Set, Minimum Vertex Cover, Theoretical Computer Science