Optimization problems in multiple subtree graphs

Danny Hermelin; Dror Rawitz

doi:10.1007/978-3-642-12450-1_18

Optimization problems in multiple subtree graphs

Danny Hermelin, Dror Rawitz

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

1 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 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	https://doi.org/10.1007/978-3-642-12450-1_18
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.

Access to Document

10.1007/978-3-642-12450-1_18

Cite this

Hermelin, D., & Rawitz, D. (2009). Optimization problems in multiple subtree graphs. In Approximation and Online Algorithms - 7th International Workshop, WAOA 2009, Revised Papers (pp. 194-204). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5893 LNCS). https://doi.org/10.1007/978-3-642-12450-1_18

@inproceedings{56edbeba70994b47bab38a61160a59d0,

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 in t-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.; 7th Workshop on Approximation and Online Algorithms, WAOA 2009 ; Conference date: 10-09-2009 Through 11-09-2009",

year = "2009",

doi = "10.1007/978-3-642-12450-1_18",

language = "אנגלית",

isbn = "3642124496",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "194--204",

booktitle = "Approximation and Online Algorithms - 7th International Workshop, WAOA 2009, Revised Papers",

}

Hermelin, D & Rawitz, D 2009, Optimization problems in multiple subtree graphs. in Approximation and Online Algorithms - 7th International Workshop, WAOA 2009, Revised Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5893 LNCS, pp. 194-204, 7th Workshop on Approximation and Online Algorithms, WAOA 2009, Copenhagen, Denmark, 10/09/09. https://doi.org/10.1007/978-3-642-12450-1_18

Optimization problems in multiple subtree graphs. / Hermelin, Danny; Rawitz, Dror.
Approximation and Online Algorithms - 7th International Workshop, WAOA 2009, Revised Papers. 2009. p. 194-204 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5893 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

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 - 2009

Y1 - 2009

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 in t-subtree graphs.

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 in t-subtree graphs.

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

U2 - 10.1007/978-3-642-12450-1_18

DO - 10.1007/978-3-642-12450-1_18

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:78651225935

SN - 3642124496

SN - 9783642124495

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 194

EP - 204

BT - Approximation and Online Algorithms - 7th International Workshop, WAOA 2009, Revised Papers

T2 - 7th Workshop on Approximation and Online Algorithms, WAOA 2009

Y2 - 10 September 2009 through 11 September 2009

ER -

Optimization problems in multiple subtree graphs

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this