On the Positive-Negative Partial Set Cover problem
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. (C) 2008 Elsevier B.V. All rights reserved.
set cover approximation algorithms combinatorial problems hardness of approximation