Discrete Mathematics - Topics on domination
Approximation algorithms for hitting objects with straight lines
Discrete Applied Mathematics
Linear programming
The Minimum Satisfiability Problem
SIAM Journal on Discrete Mathematics
Nonoverlapping local alignments (weighted independent sets of axis-parallel rectangles)
Discrete Applied Mathematics - Special volume on computational molecular biology
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
NC-approximation schemes for NP- and PSPACE-hard problems for geometric graphs
Journal of Algorithms
Graph classes: a survey
Label placement by maximum independent set in rectangles
WADS '97 Selected papers presented at the international workshop on Algorithms and data structure
Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
A unified approach to approximating resource allocation and scheduling
Journal of the ACM (JACM)
Efficient approximation algorithms for tiling and packing problems with rectangles
Journal of Algorithms
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Polynomial-time approximation schemes for packing and piercing fat objects
Journal of Algorithms
On the computational complexity of 2-interval pattern matching problems
Theoretical Computer Science
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Dotted interval graphs and high throughput genotyping
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Polynomial-Time Approximation Schemes for Geometric Intersection Graphs
SIAM Journal on Computing
Optimization problems in multiple-interval graphs
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Approximating the 2-interval pattern problem
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Using fractional primal-dual to schedule split intervals with demands
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Rounding to an integral program
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Cyclical scheduling and multi-shift scheduling: Complexity and approximation algorithms
Discrete Optimization
Integrated Sequencing and Scheduling in Coil Coating
Management Science
Parameterized complexity in multiple-interval graphs: partition, separation, irredundancy
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Dominating set is fixed parameter tractable in claw-free graphs
Theoretical Computer Science
Parameterized complexity in multiple-interval graphs: domination
IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Theoretical Computer Science
Optimization problems in dotted interval graphs
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
Online selection of intervals and t-intervals
Information and Computation
Hi-index | 0.00 |
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.