Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

8

IPL
2008

favoriteEmaildiscussreport

135views more IPL 2008»

On the Positive-Negative Partial Set Cover problem

13 years 4 months ago

On the Positive-Negative Partial Set Cover problem

Download www.cs.helsinki.fi

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

Real-time Traffic

Certain Data Mining | IPL 2008 | Partial Set Cover | Set Cover Problem |

claim paper

Related Content

» Approximation Algorithms for Partial Covering Problems

» A Partial Set Covering Model for Protein Mixture Identification Using Mass Spectrometry Da...

» Subexponential Algorithms for Partial Cover Problems

» A Unified Approach to Approximating Partial Covering Problems

» Approximation algorithms for partially covering with edges

» A PrimalDual Approximation Algorithm for Partial Vertex Cover Making Educated Guesses

» The minimum consistent subset cover problem and its applications in data mining

» The Flow Set with Partial Order

» Negative thinking by incremental problem solving application to unate covering

Post Info
More Details (n/a)

Added	12 Dec 2010
Updated	12 Dec 2010
Type	Journal
Year	2008
Where	IPL
Authors	Pauli Miettinen

Comments (0)