Theory of linear and integer programming
Theory of linear and integer programming
Integer and combinatorial optimization
Integer and combinatorial optimization
A threshold of ln n for approximating set cover
Journal of the ACM (JACM)
On the consecutive ones property
Discrete Applied Mathematics - Special volume on computational molecular biology DAM-CMB series volume 2
On the red-blue set cover problem
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Introduction to Algorithms
PC trees and circular-ones arrangements
Theoretical Computer Science - Computing and combinatorics
Wavelength rerouting in optical networks, or the Venetian Routing problem
Journal of Algorithms
A new polynomial-time algorithm for linear programming
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Computational Geometry: Theory and Applications - Special issue on the 19th European workshop on computational geometry - EuroCG 03
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Journal of Computer and System Sciences
Approximability and parameterized complexity of consecutive ones submatrix problems
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Interference in cellular networks: the minimum membership set cover problem
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Set covering with almost consecutive ones property
Discrete Optimization
Parameterized Complexity
An improved algorithm for the red-blue hitting set problem with the consecutive ones property
Information Processing Letters
| Hi-index | 0.00 |
Set Cover problems are of core importance in many applications. In recent research, the ''red-blue variants'' where blue elements all need to be covered whereas red elements add further constraints on the optimality of a covering have received considerable interest. Application scenarios range from data mining to interference reduction in cellular networks. As a rule, these problem variants are computationally at least as hard as the original set cover problem. In this work we investigate whether and how the well-known consecutive ones property, restricting the structure of the input sets, makes the red-blue covering problems feasible. We explore a sharp border between polynomial-time solvability and NP-hardness for these problems.