Abstract
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.
Original language | American English |
---|---|
Pages (from-to) | 588-594 |
Number of pages | 7 |
Journal | Discrete Applied Mathematics |
Volume | 159 |
Issue number | 7 |
DOIs | |
State | Published - 6 Apr 2011 |
Externally published | Yes |
Keywords
- Approximation algorithms
- Maximum clique
- Maximum independent set
- Minimum coloring
- Minimum dominating set
- Minimum vertex cover
- Multiple subtree graphs
All Science Journal Classification (ASJC) codes
- Discrete Mathematics and Combinatorics
- Applied Mathematics