Login / Signup
Dynamic set cover: improved algorithms and lower bounds.
Amir Abboud
Raghavendra Addanki
Fabrizio Grandoni
Debmalya Panigrahi
Barna Saha
Published in:
STOC (2019)
Keyphrases
</>
set cover
lower bound
greedy heuristics
approximation algorithms
np hard
worst case
greedy algorithm
objective function
data structure
solution space
data mining
social networks
reinforcement learning
upper bound
greedy heuristic