Deterministic Near-Optimal Approximation Algorithms for Dynamic Set Cover

In the dynamic minimum set cover problem, the challenge is to minimize the update time while guaranteeing a close-to-optimal approximation factor. (Throughout, , , , and are parameters denoting the maximum number of elements, the number of sets, the frequency, and the cost range.) In the high-frequency range, when , this was achieved by a deterministic -approximation algorithm with amortized update time by Gupta et al. [Online and dynamic algorithms for set cover, in Proceedings STOC 2017, ACM, pp. 537–550]. In this paper we consider the low-frequency range, when , and obtain deterministic algorithms with a -approximation ratio and the following guarantees on the update time. (1) amortized update time: Prior to our work, the best approximation ratio guaranteed by deterministic algorithms was of Bhattacharya, Henzinger, and Italiano [Design of dynamic algorithms via primal-dual method, in Proceedings ICALP 2015, Springer, pp. 206–218]. In contrast, the only result with -approximation was that of Abboud et al. [Dynamic set cover: Improved algorithms and lower bounds, in Proceedings STOC 2019, ACM, pp. 114–125], who designed a randomized -approximation algorithm with amortized update time. (2) amortized update time: This result improves the above update time bound for most values of in the low-frequency range, i.e., . It is also the first result that is independent of and . It subsumes the constant amortized update time of Bhattacharya and Kulkarni [Deterministically maintaining a -approximate minimum vertex cover in amortized update time, in Proceedings SODA 2019, SIAM, pp. 1872–1885] for unweighted dynamic vertex cover (i.e., when and ). (3) worst-case update time: No nontrivial worst-case update time was previously known for the dynamic set cover problem. Our bound subsumes and improves by a logarithmic factor the worst-case update time for the unweighted dynamic vertex cover problem (i.e., when and ) of Bhattacharya, Henzinger, and Nanongkai [Fully dynamic approximate maximum matching and minimum vertex cover in worst case update time, in Proceedings SODA 2017, SIAM, pp. 470–489]. We achieve our results via the primal-dual approach, by maintaining a fractional packing solution as a dual certificate. Prior work in dynamic algorithms that employs the primal-dual approach uses a local update scheme that maintains relaxed complementary slackness conditions for every set. For our first result we use instead a global update scheme that does not always maintain complementary slackness conditions. For our second result we combine the global and the local update schema. To achieve our third result we use a hierarchy of background schedulers. It is an interesting open question whether this background scheduler technique can also be used to transform algorithms with amortized running time bounds into algorithms with worst-case running time bounds.