Improved Approximation Algorithms for Predicting RNA Secondary Structures with Arbitrary Pseudoknots
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
On Recovering Syntenic Blocks from Comparative Maps
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Packing and Covering δ-Hyperbolic Spaces by Balls
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
Approximability and Fixed-Parameter Tractability for the Exemplar Genomic Distance Problems
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
On the Tractability of Maximal Strip Recovery
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Maximal Strip Recovery Problem with Gaps: Hardness and Approximation Algorithms
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
On restrictions of balanced 2-interval graphs
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Approximation Algorithms for Predicting RNA Secondary Structures with Arbitrary Pseudoknots
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
On the parameterized complexity of some optimization problems related to multiple-interval graphs
Theoretical Computer Science
On linear and semidefinite programming relaxations for hypergraph matching
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
On the parameterized complexity of some optimization problems related to multiple-interval graphs
CPM'10 Proceedings of the 21st annual conference on Combinatorial pattern matching
Efficient exact and approximate algorithms for the complement of maximal strip recovery
AAIM'10 Proceedings of the 6th international conference on Algorithmic aspects in information and management
Inapproximability of maximal strip recovery: II
FAW'10 Proceedings of the 4th international conference on Frontiers in algorithmics
Recognizing d-interval graphs and d-track interval graphs
FAW'10 Proceedings of the 4th international conference on Frontiers in algorithmics
Approximation algorithms for intersection graphs
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Minimum vertex cover in rectangle graphs
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Optimization problems in multiple subtree graphs
Discrete Applied Mathematics
SIAM Journal on Computing
Integrated Sequencing and Scheduling in Coil Coating
Management Science
Minimum vertex cover in rectangle graphs
Computational Geometry: Theory and Applications
Inapproximability of maximal strip recovery
Theoretical Computer Science
Iterative packing for demand and hypergraph matching
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
An improved approximation algorithm for the complementary maximal strip recovery problem
FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
On tree-constrained matchings and generalizations
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Parameterized complexity in multiple-interval graphs: partition, separation, irredundancy
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Strip graphs: recognition and scheduling
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
MobiHoc '11 Proceedings of the Twelfth ACM International Symposium on Mobile Ad Hoc Networking and Computing
An improved approximation algorithm for the complementary maximal strip recovery problem
Journal of Computer and System Sciences
Optimization problems in multiple subtree graphs
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
Exact and approximation algorithms for the complementary maximal strip recovery problem
Journal of Combinatorial Optimization
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
Theoretical Computer Science
Optimization problems in dotted interval graphs
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
The maximum clique problem in multiple interval graphs (extended abstract)
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
Maximal strip recovery problem with gaps: Hardness and approximation algorithms
Journal of Discrete Algorithms
Scheduling jobs with multiple non-uniform tasks
Euro-Par'13 Proceedings of the 19th international conference on Parallel Processing
Online selection of intervals and t-intervals
Information and Computation
Hi-index | 0.02 |
We consider the problem of scheduling jobs that are given as groups of nonintersecting segments on the real line. Each job $J_j$ is associated with an interval, $I_j$, which consists of up to $t$ segments, for some $t \geq 1$, and a weight (profit), $w_j$; two jobs are in conflict if their intervals intersect. Such jobs show up in a wide range of applications, including the transmission of continuous-media data, allocation of linear resources (e.g., bandwidth in linear processor arrays), and computational biology/geometry. The objective is to schedule a subset of nonconflicting jobs of maximum total weight.Our problem can be formulated as the problem of finding a maximum weight independent set in a t-interval graph (the special case of $t=1$ is an ordinary interval graph). We show that, for $t \geq 2$, this problem is APX-hard, even for highly restricted instances. Our main result is a $2t$-approximation algorithm for general instances. This is based on a novel fractional version of the Local Ratio technique. One implication of this result is the first constant factor approximation for nonoverlapping alignment of genomic sequences. We also derive a bicriteria polynomial time approximation scheme for a restricted subclass of $t$-interval graphs.