Before revision: 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 S \subseteq 2^{U} as input, where each set s \in S has a cost 1/C < c_s < 1 for some parameter C > 1. The input keeps changing via a sequence of updates.
After revision: We consider the minimum set cover problem and a collection of sets S \subseteq 2^{U} as input, where each set s \in S has a cost 1/C < c_s < 1 for some parameter C > 1. The input keeps changing via a sequence of updates.