Journal of the ACM (JACM)
Handbook of combinatorics (vol. 1)
Handbook of combinatorics (vol. 1)
Improved performance of the greedy algorithm for partial cover
Information Processing Letters
Using homogenous weights for approximating the partial cover problem
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
A 2 + ε approximation algorithm for the k-MST problem
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Vertex cover: further observations and further improvements
Journal of Algorithms
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
Vertex cover: exact and approximation algorithms and applications
Vertex cover: exact and approximation algorithms and applications
Parameterized Complexity
Improved Upper Bounds for Partial Vertex Cover
Graph-Theoretic Concepts in Computer Science
Capacitated domination and covering: a parameterized perspective
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
On the hardness of approximating stopping and trapping sets
IEEE Transactions on Information Theory
A Partial Set Covering Model for Protein Mixture Identification Using Mass Spectrometry Data
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Subexponential algorithms for partial cover problems
Information Processing Letters
Implicit branching and parameterized partial cover problems
Journal of Computer and System Sciences
Survey: Covering problems in facility location: A review
Computers and Industrial Engineering
A General Approach for Incremental Approximation and Hierarchical Clustering
SIAM Journal on Computing
Triangles, 4-cycles and parameterized (in-)tractability
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Parameterized complexity of generalized vertex cover problems
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Intuitive algorithms and t-vertex cover
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Campaigns for lazy voters: truncated ballots
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Efficient algorithms for the max k-vertex cover problem
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
| Hi-index | 0.95 |
We study the generalization of covering problems such as the set cover problem to partial covering problems. Here we only want to cover a given number k of elements rather than all elements. For instance, in the k-partial (weighted) set cover problem, we wish to compute a minimum weight collection of sets that covers at least k elements. As a main result, we show that the k-partial set cover problem and its special cases like the k-partial vertex cover problem are all fixed parameter tractable (with parameter k). As a second example, we consider the minimum weight k-partial t-restricted cycle cover problem.