TY - GEN

T1 - Optimization problems in multiple-interval graphs

AU - Butman, Ayelet

AU - Hermelin, Dan

AU - Lewenstein, Moshe

AU - Rawitz, Dror

N1 - Publisher Copyright:
Copyright © 2007 by the Association for Computing Machinery, Inc. and the Society for Industrial and Applied Mathematics.
Copyright:
Copyright 2017 Elsevier B.V., All rights reserved.

PY - 2007/1/1

Y1 - 2007/1/1

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 equals the best known ratio for 2t - 1 bounded degree graphs. Since these graphs are known to be included in multiple-interval graphs with t intervals associated to each vertex, this ratio is in some sense tight. 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-complete for the case of t = 3, and provide a (t2 -t+1)/2-approximation algorithm for the problem, using recent 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 equals the best known ratio for 2t - 1 bounded degree graphs. Since these graphs are known to be included in multiple-interval graphs with t intervals associated to each vertex, this ratio is in some sense tight. 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-complete for the case of t = 3, and provide a (t2 -t+1)/2-approximation algorithm for the problem, using recent bounds proven for the so-called transversal number of t-interval families.

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

M3 - Conference contribution

AN - SCOPUS:84969190711

SN - 978-089871624-5

T3 - Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

SP - 268

EP - 277

BT - Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

PB - Society of Industrial and Applied Mathematics

T2 - 18th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007

Y2 - 7 January 2007 through 9 January 2007

ER -