Set Cover in Sub-linear Time.
Piotr IndykSepideh MahabadiRonitt RubinfeldAli VakilianAnak YodpinyaneePublished in: SODA (2018)
Keyphrases
- set cover
- greedy algorithm
- approximation algorithms
- worst case
- np hard
- network flow
- greedy heuristics
- solution space
- greedy heuristic
- convex hull
- linear programming
- primal dual
- optimal solution
- machine learning
- integer programming
- minimum cost
- neural network
- np complete
- data sets
- knapsack problem
- special case
- image processing
- data mining