Optimization problems in multiple subtree graphs

Danny Hermelin; Dror Rawitz

doi:10.1016/j.dam.2010.03.010

Optimization problems in multiple subtree graphs

Danny Hermelin, Dror Rawitz

Research output: Contribution to journal › Article › peer-review

4 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 language	English
Pages (from-to)	588-594
Number of pages	7
Journal	Discrete Applied Mathematics
Volume	159
Issue number	7
DOIs	https://doi.org/10.1016/j.dam.2010.03.010
State	Published - 6 Apr 2011
Externally published	Yes

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	Funder number
Israel Academy of Sciences and Humanities

Keywords

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

Access to Document

10.1016/j.dam.2010.03.010

Cite this

@article{c367c6defdef4c098953b1faf0a6d6ba,

title = "Optimization problems in multiple subtree graphs",

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.",

keywords = "Approximation algorithms, Maximum clique, Maximum independent set, Minimum coloring, Minimum dominating set, Minimum vertex cover, Multiple subtree graphs",

author = "Danny Hermelin and Dror Rawitz",

note = "Funding Information: The first author was supported by the Adams Fellowship of the Israel Academy of Sciences and Humanities. ",

year = "2011",

month = apr,

day = "6",

doi = "10.1016/j.dam.2010.03.010",

language = "אנגלית",

volume = "159",

pages = "588--594",

journal = "Discrete Applied Mathematics",

issn = "0166-218X",

publisher = "Elsevier B.V.",

number = "7",

}

TY - JOUR

T1 - Optimization problems in multiple subtree graphs

AU - Hermelin, Danny

AU - Rawitz, Dror

N1 - Funding Information: The first author was supported by the Adams Fellowship of the Israel Academy of Sciences and Humanities.

PY - 2011/4/6

Y1 - 2011/4/6

N2 - 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.

AB - 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.

KW - Approximation algorithms

KW - Maximum clique

KW - Maximum independent set

KW - Minimum coloring

KW - Minimum dominating set

KW - Minimum vertex cover

KW - Multiple subtree graphs

UR - http://www.scopus.com/inward/record.url?scp=79952183885&partnerID=8YFLogxK

U2 - 10.1016/j.dam.2010.03.010

DO - 10.1016/j.dam.2010.03.010

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:79952183885

SN - 0166-218X

VL - 159

SP - 588

EP - 594

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

IS - 7

ER -

Optimization problems in multiple subtree graphs

Abstract

Bibliographical note

Funding

Keywords

Access to Document

Other files and links

Fingerprint

Cite this