Optimization problems in multiple subtree graphs

Authors:
Danny Hermelin;Dror Rawitz
Affiliations:
Department of Computer Science, University of Haifa, Haifa, Israel;Department of Electrical Engineering, Tel-Aviv University, Tel-Aviv, Israel
Venue:
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
Year:
2009

Citing 6
Cited 0

A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Scheduling split intervals

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover

SIAM Journal on Computing
Scheduling Split Intervals

SIAM Journal on Computing
Optimization problems in multiple-interval graphs

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Path Hitting in Acyclic Graphs

Algorithmica

Quantified Score

Hi-index	0.00

Visualization

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.