Optimization problems in multiple subtree graphs

Danny Hermelin, Dror Rawitz

Research output: Contribution to journalArticlepeer-review

2 Scopus citations

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 languageEnglish
Pages (from-to)588-594
Number of pages7
JournalDiscrete Applied Mathematics
Volume159
Issue number7
DOIs
StatePublished - 6 Apr 2011
Externally publishedYes

Keywords

  • Approximation algorithms
  • Maximum clique
  • Maximum independent set
  • Minimum coloring
  • Minimum dominating set
  • Minimum vertex cover
  • Multiple subtree graphs

Fingerprint

Dive into the research topics of 'Optimization problems in multiple subtree graphs'. Together they form a unique fingerprint.

Cite this