The worst case behavior of a greedy algorithm for a class of pseudo-Boolean functions.
M. Reza Emamy-KhansaryPublished in: Discret. Appl. Math. (1989)
Keyphrases
- greedy algorithm
- worst case
- greedy algorithms
- pseudo boolean functions
- submodular functions
- set cover
- average case
- greedy strategy
- dynamic programming
- approximation algorithms
- greedy heuristic
- objective function
- knapsack problem
- upper bound
- np hard
- influence spread
- lower bound
- combinatorial search
- computational complexity