Approximation Algorithms for Stochastic Submodular Set Cover with Applications to Boolean Function Evaluation and Min-Knapsack.
Amol DeshpandeLisa HellersteinDevorah KletenikPublished in: ACM Trans. Algorithms (2016)
Keyphrases
- set cover
- approximation algorithms
- boolean functions
- greedy algorithm
- np hard
- special case
- worst case
- knapsack problem
- greedy heuristic
- uniform distribution
- minimum cost
- network flow
- dynamic programming
- facility location problem
- optimal solution
- approximation ratio
- primal dual
- upper bound
- undirected graph
- lower bound
- objective function
- constant factor
- functional properties
- genetic algorithm
- constant factor approximation
- solution space
- convex hull
- decision trees