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.
The positive-negative partial set cover problem REF is a generalization of the classical set cover problem in combinatorics.
On the positive–negative partial set cover problem
Inf. Process. Lett
Mathematics Computer Science