On the red-blue set cover problem
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
On the hardness of approximating label-cover
Information Processing Letters
Approximating a collection of frequent sets
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Approximation algorithms for the Label-CoverMAX and Red-Blue Set Cover problems
Journal of Discrete Algorithms
The Boolean column and column-row matrix decompositions
Data Mining and Knowledge Discovery
Synthesizing view definitions from data
Proceedings of the 13th International Conference on Database Theory
Covering analysis of the greedy algorithm for partial cover
Algorithms and Applications
Evader interdiction and collateral damage
ALGOSENSORS'11 Proceedings of the 7th international conference on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities
Discovering relations using matrix factorization methods
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
An optimization framework for role mining
Journal of Computer Security
| Hi-index | 0.90 |
The Positive-Negative Partial Set Cover problem is introduced and its complexity, especially the hardness-of-approximation, is studied. The problem generalizes the Set Cover problem, and it naturally arises in certain data mining applications.