TY - GEN

T1 - Optimization problems in multiple-interval graphs

AU - Butman, A

AU - Hermelin, D

AU - Lewenstein, M

AU - Rawitz, D

N1 - Place of conference:USA

PY - 2007

Y1 - 2007

N2 - Multiple-interval graphs are a natural generalization of interval graphs where each vertex may have more then one interval associated with it. We initiate the study of optimization problems in multiple-interval graphs by considering three classical problems: Minimum Vertex Cover, Minimum Dominating Set, and Maximum Clique. We describe applications for each one of these problems, and then proceed to discuss approximation algorithms for them.
Our results can be summarized as follows: Let t be the number of intervals associated with each vertex in a given multiple-interval graph. For Minimum Vertex Cover, we give a (2−1/t)-approximation algorithm which also works when a t-interval representation of our given graph is absent. Following this, we give a t2-approximation algorithm for Minimum Dominating Set which adapts well to more general variants of the problem. We then proceed to prove that Maximum Clique is NP-hard already for 3-interval graphs, and provide a (t2−t+1)/2-approximation algorithm for general values of t ≥ 2, using bounds proven for the so-called transversal number of t-interval families.

AB - Multiple-interval graphs are a natural generalization of interval graphs where each vertex may have more then one interval associated with it. We initiate the study of optimization problems in multiple-interval graphs by considering three classical problems: Minimum Vertex Cover, Minimum Dominating Set, and Maximum Clique. We describe applications for each one of these problems, and then proceed to discuss approximation algorithms for them.
Our results can be summarized as follows: Let t be the number of intervals associated with each vertex in a given multiple-interval graph. For Minimum Vertex Cover, we give a (2−1/t)-approximation algorithm which also works when a t-interval representation of our given graph is absent. Following this, we give a t2-approximation algorithm for Minimum Dominating Set which adapts well to more general variants of the problem. We then proceed to prove that Maximum Clique is NP-hard already for 3-interval graphs, and provide a (t2−t+1)/2-approximation algorithm for general values of t ≥ 2, using bounds proven for the so-called transversal number of t-interval families.

UR - https://scholar.google.co.il/scholar?q=Optimization+problems+in+multiple-interval+graphs&btnG=&hl=en&as_sdt=0%2C5

M3 - Conference contribution

BT - Symposium on Discrete Algorithms (SODA)

ER -