Improved Performance of the Greedy Algorithm for the Minimum Set Cover and Minimum Partial Cover Problems
Petr SlavíkPublished in: Electron. Colloquium Comput. Complex. (1995)
Keyphrases
- greedy algorithm
- set cover
- greedy algorithms
- greedy heuristics
- greedy heuristic
- worst case
- objective function
- dynamic programming
- network flow
- approximation algorithms
- greedy strategy
- optimization problems
- minimum cost
- submodular functions
- np hard
- solution space
- random walk
- influence maximization
- data mining techniques