A succinct and approximate greedy algorithm for the Minimum Set Cover Problem.
Jorge DelgadoHéctor FerradaCristóbal A. NavarroPublished in: J. Comput. Sci. (2024)
Keyphrases
- set cover
- greedy algorithm
- greedy heuristics
- greedy algorithms
- worst case
- dynamic programming
- greedy strategy
- objective function
- greedy heuristic
- np hard
- knapsack problem
- approximation algorithms
- network flow
- influence spread
- special case
- submodular functions
- minimum cost
- solution space
- randomized algorithm
- machine learning
- social network analysis
- search engine
- learning algorithm