TY - GEN
T1 - Optimization problems in multiple subtree graphs
AU - Hermelin, Danny
AU - Rawitz, Dror
PY - 2009/12/1
Y1 - 2009/12/1
N2 - We study various optimization problems in t-subtree graphs, the intersection graphs of t-subtrees, 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 in t-subtree graphs.
AB - We study various optimization problems in t-subtree graphs, the intersection graphs of t-subtrees, 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 in t-subtree graphs.
UR - https://www.scopus.com/pages/publications/78651225935
U2 - 10.1007/978-3-642-12450-1_18
DO - 10.1007/978-3-642-12450-1_18
M3 - Conference contribution
AN - SCOPUS:78651225935
SN - 3642124496
SN - 9783642124495
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 194
EP - 204
BT - Approximation and Online Algorithms - 7th International Workshop, WAOA 2009, Revised Papers
T2 - 7th Workshop on Approximation and Online Algorithms, WAOA 2009
Y2 - 10 September 2009 through 11 September 2009
ER -