Sciweavers

Share
IPL
2008

On the Positive-Negative Partial Set Cover problem

8 years 5 months ago
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
Pauli Miettinen
Added 12 Dec 2010
Updated 12 Dec 2010
Type Journal
Year 2008
Where IPL
Authors Pauli Miettinen
Comments (0)
books