Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
420106 | Discrete Applied Mathematics | 2011 | 7 Pages |
Abstract
We study various optimization problems in t-subtree graphs , the intersection graphs of tt-subtrees, where a tt-subtree is the union of tt disjoint subtrees of some tree. This graph class generalizes both the class of chordal graphs and the class of tt-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.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Danny Hermelin, Dror Rawitz,