A New Deterministic Algorithm for Dynamic Set Cover.
Sayan BhattacharyaMonika HenzingerDanupon NanongkaiPublished in: CoRR (2019)
Keyphrases
- set cover
- np hard
- dynamic programming
- objective function
- learning algorithm
- greedy heuristic
- image processing
- k means
- cost function
- optimal solution
- upper bound
- computational complexity
- lower bound
- search space
- genetic algorithm
- worst case
- simulated annealing
- constraint satisfaction problems
- convex hull
- greedy algorithm
- solution space
- social networks