On the Positive-Negative Partial Set Cover problem.
Pauli MiettinenPublished in: Inf. Process. Lett. (2008)
Keyphrases
- set cover
- positive and negative
- greedy algorithm
- approximation algorithms
- greedy heuristics
- np hard
- network flow
- positive or negative
- positive data
- solution space
- greedy heuristic
- convex hull
- special case
- scheduling problem
- primal dual
- convex optimization
- decision trees
- feature extraction
- dynamic programming
- linear programming
- multi dimensional
- worst case