# An Improved Algorithm for Dynamic Set Cover

Henzinger Monika
Wu Xiaowei

Abstract:

We consider the minimum set cover problem in a dynamic setting. Here, we are given a universe of elements $\mathcal{U}$ and a collection of sets $\mathcal{S} \subseteq 2^{\mathcal{U}}$ as input, where each set $s \in \mathcal{S}$ has a cost $1/C < c_s < 1$ for some parameter $C > 1$. The input keeps changing via a sequence of updates. E...More

Code:

Data: