{"language":[{"iso":"eng"}],"article_processing_charge":"No","publication_identifier":{"eisbn":["978-1-7281-4952-3"],"isbn":["978-1-7281-4953-0"],"issn":["2575-8454"]},"publication_status":"published","author":[{"full_name":"Bhattacharya, Sayan","last_name":"Bhattacharya","first_name":"Sayan"},{"orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","first_name":"Monika H"},{"first_name":"Danupon","last_name":"Nanongkai","full_name":"Nanongkai, Danupon"}],"citation":{"ista":"Bhattacharya S, Henzinger MH, Nanongkai D. 2019. A new deterministic algorithm for dynamic set cover. 60th Annual Symposium on Foundations of Computer Science. FOCS: Annual Symposium on Foundations of Computer Science, 406–423.","ieee":"S. Bhattacharya, M. H. Henzinger, and D. Nanongkai, “A new deterministic algorithm for dynamic set cover,” in <i>60th Annual Symposium on Foundations of Computer Science</i>, Baltimore, MD, United States, 2019, pp. 406–423.","short":"S. Bhattacharya, M.H. Henzinger, D. Nanongkai, in:, 60th Annual Symposium on Foundations of Computer Science, Institute of Electrical and Electronics Engineers, 2019, pp. 406–423.","ama":"Bhattacharya S, Henzinger MH, Nanongkai D. A new deterministic algorithm for dynamic set cover. In: <i>60th Annual Symposium on Foundations of Computer Science</i>. Institute of Electrical and Electronics Engineers; 2019:406-423. doi:<a href=\"https://doi.org/10.1109/focs.2019.00033\">10.1109/focs.2019.00033</a>","chicago":"Bhattacharya, Sayan, Monika H Henzinger, and Danupon Nanongkai. “A New Deterministic Algorithm for Dynamic Set Cover.” In <i>60th Annual Symposium on Foundations of Computer Science</i>, 406–23. Institute of Electrical and Electronics Engineers, 2019. <a href=\"https://doi.org/10.1109/focs.2019.00033\">https://doi.org/10.1109/focs.2019.00033</a>.","apa":"Bhattacharya, S., Henzinger, M. H., &#38; Nanongkai, D. (2019). A new deterministic algorithm for dynamic set cover. In <i>60th Annual Symposium on Foundations of Computer Science</i> (pp. 406–423). Baltimore, MD, United States: Institute of Electrical and Electronics Engineers. <a href=\"https://doi.org/10.1109/focs.2019.00033\">https://doi.org/10.1109/focs.2019.00033</a>","mla":"Bhattacharya, Sayan, et al. “A New Deterministic Algorithm for Dynamic Set Cover.” <i>60th Annual Symposium on Foundations of Computer Science</i>, Institute of Electrical and Electronics Engineers, 2019, pp. 406–23, doi:<a href=\"https://doi.org/10.1109/focs.2019.00033\">10.1109/focs.2019.00033</a>."},"type":"conference","month":"11","date_published":"2019-11-01T00:00:00Z","year":"2019","status":"public","conference":{"name":"FOCS: Annual Symposium on Foundations of Computer Science","start_date":"2019-11-09","location":"Baltimore, MD, United States","end_date":"2019-11-12"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1","doi":"10.1109/focs.2019.00033","publisher":"Institute of Electrical and Electronics Engineers","date_updated":"2023-02-17T09:50:37Z","day":"01","quality_controlled":"1","publication":"60th Annual Symposium on Foundations of Computer Science","abstract":[{"lang":"eng","text":"We present a deterministic dynamic algorithm for maintaining a (1+ε)f-approximate minimum cost set cover with O(f log(Cn)/ε^2) amortized update time, when the input set system is undergoing element insertions and deletions. Here, n denotes the number of elements, each element appears in at most f sets, and the cost of each set lies in the range [1/C, 1]. Our result, together with that of Gupta~et~al.~[STOC'17], implies that there is a deterministic algorithm for this problem with O(f log(Cn)) amortized update time and O(min(log n, f)) -approximation ratio, which nearly matches the polynomial-time hardness of approximation for minimum set cover in the static setting. Our update time is only O(log (Cn)) away from a trivial lower bound. Prior to our work, the previous best approximation ratio guaranteed by deterministic algorithms was O(f^2), which was due to Bhattacharya~et~al.~[ICALP`15]. In contrast, the only result that guaranteed O(f) -approximation was obtained very recently by Abboud~et~al.~[STOC`19], who designed a dynamic algorithm with (1+ε)f-approximation ratio and O(f^2 log n/ε) amortized update time. Besides the extra O(f) factor in the update time compared to our and Gupta~et~al.'s results, the Abboud~et~al.~algorithm is randomized, and works only when the adversary is oblivious and the sets are unweighted (each set has the same cost). We achieve our result via the primal-dual approach, by maintaining a fractional packing solution as a dual certificate. This approach was pursued previously by Bhattacharya~et~al.~and Gupta~et~al., but not in the recent paper by Abboud~et~al. Unlike previous primal-dual algorithms that try to satisfy some local constraints for individual sets at all time, our algorithm basically waits until the dual solution changes significantly globally, and fixes the solution only where the fix is needed."}],"scopus_import":"1","external_id":{"arxiv":["1909.11600"]},"date_created":"2022-08-16T08:00:00Z","page":"406-423","title":"A new deterministic algorithm for dynamic set cover","_id":"11853","main_file_link":[{"url":"https://arxiv.org/abs/1909.11600","open_access":"1"}],"oa_version":"Preprint","oa":1}