Sciweavers

Share
34 search results - page 1 / 7
» On the Positive-Negative Partial Set Cover problem
Sort
View
IPL
2008
135views more  IPL 2008»
9 years 8 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 probl...
Pauli Miettinen
FSTTCS
2009
Springer
10 years 2 months ago
Subexponential Algorithms for Partial Cover Problems
Partial Cover problems are optimization versions of fundamental and well studied problems like Vertex Cover and Dominating Set. Here one is interested in covering (or dominating) ...
Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman...
ICALP
2001
Springer
10 years 14 days ago
Approximation Algorithms for Partial Covering Problems
We study the generalization of covering problems to partial covering. Here we wish to cover only a desired number of elements, rather than covering all elements as in standard cov...
Rajiv Gandhi, Samir Khuller, Aravind Srinivasan
TCBB
2011
9 years 2 months ago
A Partial Set Covering Model for Protein Mixture Identification Using Mass Spectrometry Data
—Protein identification is a key and essential step in mass spectrometry (MS) based proteome research. To date, there are many protein identification strategies that employ eithe...
Zengyou He, Can Yang, Weichuan Yu
ESA
2006
Springer
134views Algorithms» more  ESA 2006»
9 years 11 months ago
A Unified Approach to Approximating Partial Covering Problems
An instance of the generalized partial cover problem consists of a ground set U and a family of subsets S 2U . Each element e U is associated with a profit p(e), whereas each su...
Jochen Könemann, Ojas Parekh, Danny Segev
books