Anzeige
Erschienen in:
2010 | OriginalPaper | Buchkapitel
Optimization Problems in Multiple Subtree Graphs
verfasst von : Danny Hermelin, Dror Rawitz
Erschienen in: Approximation and Online Algorithms
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.