Optimization problems in multiple subtree graphs

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.

[1]  Douglas B. West,et al.  Extremal Values of the Interval Number of a Graph , 1980, SIAM J. Matrix Anal. Appl..

[2]  Mihalis Yannakakis,et al.  Optimization, approximation, and complexity classes , 1991, STOC '88.

[3]  Venkatesan Guruswami,et al.  A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover , 2005, SIAM J. Comput..

[4]  Fanica Gavril,et al.  Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph , 1972, SIAM J. Comput..

[5]  F. Gavril.  The intersection graphs of subtrees in tree are exactly the chordal graphs , 1974 .

[6]  Eli Berger.  KKM—A Topological Approach For Trees , 2004, Comb..

[7]  Ran Raz,et al.  A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP , 1997, STOC '97.

[8]  Ojas Parekh,et al.  Path Hitting in Acyclic Graphs , 2007, Algorithmica.

[9]  David B. Shmoys,et al.  Recognizing graphs with fixed interval number is NP-complete , 1984, Discret. Appl. Math..

[10]  Reuven Bar-Yehuda,et al.  A Local-Ratio Theorem for Approximating the Weighted Vertex Cover Problem , 1983, WG.

[11]  M. Golumbic.  Algorithmic graph theory and perfect graphs , 1980 .

[12]  Kellogg S. Booth,et al.  Dominating Sets in Chordal Graphs , 1982, SIAM J. Comput..

[13]  Reuven Bar-Yehuda,et al.  Scheduling split intervals , 2002, SODA '02.

[14]  Dorit S. Hochbaum,et al.  Efficient bounds for the stable set, vertex cover and set packing problems , 1983, Discret. Appl. Math..

[15]  R. Steele.  Optimization , 2005 .

[16]  David S. Johnson,et al.  Some Simplified NP-Complete Graph Problems , 1976, Theor. Comput. Sci..

[17]  Moshe Lewenstein,et al.  Optimization problems in multiple-interval graphs , 2007, SODA '07.