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 in t-subtree graphs.
| Original language | English |
|---|---|
| Title of host publication | Approximation and Online Algorithms - 7th International Workshop, WAOA 2009, Revised Papers |
| Pages | 194-204 |
| Number of pages | 11 |
| DOIs | |
| State | Published - 2009 |
| Externally published | Yes |
| Event | 7th Workshop on Approximation and Online Algorithms, WAOA 2009 - Copenhagen, Denmark Duration: 10 Sep 2009 → 11 Sep 2009 |
Publication series
| Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Volume | 5893 LNCS |
| ISSN (Print) | 0302-9743 |
| ISSN (Electronic) | 1611-3349 |
Conference
| Conference | 7th Workshop on Approximation and Online Algorithms, WAOA 2009 |
|---|---|
| Country/Territory | Denmark |
| City | Copenhagen |
| Period | 10/09/09 → 11/09/09 |
Bibliographical note
Funding Information:The first author was supported by the Adams Fellowship of the Israel Academy of Sciences and Humanities.
Funding
The first author was supported by the Adams Fellowship of the Israel Academy of Sciences and Humanities.
| Funders |
|---|
| Israel Academy of Sciences and Humanities |