Set Cover Revisited: Hypergraph Cover with Hard Capacities.
Barna SahaSamir KhullerPublished in: ICALP (1) (2012)
Keyphrases
- set cover
- np hard
- greedy algorithm
- approximation algorithms
- greedy heuristics
- network flow
- greedy heuristic
- solution space
- convex hull
- higher order
- np complete
- special case
- scheduling problem
- optimal solution
- evolutionary algorithm
- pairwise
- integer programming
- learning algorithm
- hypergraph model
- primal dual
- minimum cost
- convex optimization
- computational complexity
- decision trees