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. Key words: Approximation algorithms, Combinatorial problems, Hardness of approximation, Set cover

• Type: Journal
• Year: 2008
• Where: IPL
• Authors: Pauli Miettinen
• Keywords: Certain Data Mining, IPL 2008, Partial Set Cover, Set Cover Problem