Online and Dynamic Algorithms for Geometric Set Cover and Hitting Set.
Arindam KhanAditya LonkarSaladi RahulAditya SubramanianAndreas WiesePublished in: SoCG (2023)
Keyphrases
- set cover
- greedy algorithm
- greedy heuristics
- approximation algorithms
- network flow
- solution space
- np hard
- greedy heuristic
- convex hull
- data structure
- minimum cost
- computational complexity
- simulated annealing
- neural network
- markov chain
- online algorithms
- online learning
- worst case
- dynamic programming
- image processing
- data mining