{"_id":"11920","citation":{"short":"S. Bhattacharya, M.H. Henzinger, D. Nanongkai, X. Wu, in:, 32nd Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2021, pp. 2537–2549.","chicago":"Bhattacharya, Sayan, Monika H Henzinger, Danupon Nanongkai, and Xiaowei Wu. “Dynamic Set Cover: Improved Amortized and Worst-Case Update Time.” In <i>32nd Annual ACM-SIAM Symposium on Discrete Algorithms</i>, 2537–49. Society for Industrial and Applied Mathematics, 2021. <a href=\"https://doi.org/10.1137/1.9781611976465.150\">https://doi.org/10.1137/1.9781611976465.150</a>.","apa":"Bhattacharya, S., Henzinger, M. H., Nanongkai, D., &#38; Wu, X. (2021). Dynamic set cover: Improved amortized and worst-case update time. In <i>32nd Annual ACM-SIAM Symposium on Discrete Algorithms</i> (pp. 2537–2549). Alexandria, VA, United States: Society for Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1137/1.9781611976465.150\">https://doi.org/10.1137/1.9781611976465.150</a>","ama":"Bhattacharya S, Henzinger MH, Nanongkai D, Wu X. Dynamic set cover: Improved amortized and worst-case update time. In: <i>32nd Annual ACM-SIAM Symposium on Discrete Algorithms</i>. Society for Industrial and Applied Mathematics; 2021:2537-2549. doi:<a href=\"https://doi.org/10.1137/1.9781611976465.150\">10.1137/1.9781611976465.150</a>","ista":"Bhattacharya S, Henzinger MH, Nanongkai D, Wu X. 2021. Dynamic set cover: Improved amortized and worst-case update time. 32nd Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 2537–2549.","mla":"Bhattacharya, Sayan, et al. “Dynamic Set Cover: Improved Amortized and Worst-Case Update Time.” <i>32nd Annual ACM-SIAM Symposium on Discrete Algorithms</i>, Society for Industrial and Applied Mathematics, 2021, pp. 2537–49, doi:<a href=\"https://doi.org/10.1137/1.9781611976465.150\">10.1137/1.9781611976465.150</a>.","ieee":"S. Bhattacharya, M. H. Henzinger, D. Nanongkai, and X. Wu, “Dynamic set cover: Improved amortized and worst-case update time,” in <i>32nd Annual ACM-SIAM Symposium on Discrete Algorithms</i>, Alexandria, VA, United States, 2021, pp. 2537–2549."},"oa_version":"Preprint","main_file_link":[{"url":"https://arxiv.org/abs/2002.11171","open_access":"1"}],"doi":"10.1137/1.9781611976465.150","abstract":[{"text":"In the dynamic minimum set cover problem, a challenge is to minimize the update time while guaranteeing close to the optimal min(O(log n), f) approximation factor. (Throughout, m, n, f, and C are parameters denoting the maximum number of sets, number of elements, frequency, and the cost range.) In the high-frequency range, when f = Ω(log n), this was achieved by a deterministic O(log n)-approximation algorithm with O(f log n) amortized update time [Gupta et al. STOC'17]. In the low-frequency range, the line of work by Gupta et al. [STOC'17], Abboud et al. [STOC'19], and Bhattacharya et al. [ICALP'15, IPCO'17, FOCS'19] led to a deterministic (1 + ∊) f-approximation algorithm with O(f log(Cn)/∊2) amortized update time. In this paper we improve the latter update time and provide the first bounds that subsume (and sometimes improve) the state-of-the-art dynamic vertex cover algorithms. We obtain: (1) (1 + ∊) f-approximation ratio in O(f log2(Cn)/∊3) worst-case update time: No non-trivial worst-case update time was previously known for dynamic set cover. Our bound subsumes and improves by a logarithmic factor the O(log3 n/poly(∊)) worst-case update time for unweighted dynamic vertex cover (i.e., when f = 2 and C = 1) by Bhattacharya et al. [SODA'17]. (2) (1 + ∊) f-approximation ratio in O ((f2/∊3) + (f/∊2) log C) amortized update time: This result improves the previous O(f log (Cn)/∊2) update time bound for most values of f in the low-frequency range, i.e. whenever f = o(log n). It is the first that is independent of m and n. It subsumes the constant amortized update time of Bhattacharya and Kulkarni [SODA'19] for unweighted dynamic vertex cover (i.e., when f = 2 and C = 1). These results are achieved by leveraging the approximate complementary slackness and background schedulers techniques. These techniques were used in the local update scheme for dynamic vertex cover. Our main technical contribution is to adapt these techniques within the global update scheme of Bhattacharya et al. [FOCS'19] for the dynamic set cover problem.","lang":"eng"}],"publication":"32nd Annual ACM-SIAM Symposium on Discrete Algorithms","article_processing_charge":"No","date_published":"2021-01-01T00:00:00Z","extern":"1","quality_controlled":"1","title":"Dynamic set cover: Improved amortized and worst-case update time","type":"conference","publication_identifier":{"eisbn":["978-1-61197-646-5"]},"author":[{"full_name":"Bhattacharya, Sayan","last_name":"Bhattacharya","first_name":"Sayan"},{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H","last_name":"Henzinger","orcid":"0000-0002-5008-6530","first_name":"Monika H"},{"full_name":"Nanongkai, Danupon","last_name":"Nanongkai","first_name":"Danupon"},{"last_name":"Wu","full_name":"Wu, Xiaowei","first_name":"Xiaowei"}],"year":"2021","language":[{"iso":"eng"}],"publication_status":"published","page":"2537-2549","day":"01","month":"01","date_updated":"2023-02-17T11:31:22Z","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"conference":{"name":"SODA: Symposium on Discrete Algorithms","location":"Alexandria, VA, United States","end_date":"2021-01-13","start_date":"2021-01-10"},"date_created":"2022-08-18T07:46:54Z","scopus_import":"1","external_id":{"arxiv":["2002.11171"]},"publisher":"Society for Industrial and Applied Mathematics"}