{"publication_identifier":{"issn":["0890-5401"]},"date_updated":"2023-02-10T07:27:39Z","volume":261,"extern":"1","type":"journal_article","publication":"Information and Computation","publication_status":"published","abstract":[{"text":"We develop a dynamic version of the primal-dual method for optimization problems, and apply it to obtain the following results. (1) For the dynamic set-cover problem, we maintain an O ( f 2)-approximately optimal solution in O ( f · log(m + n)) amortized update time, where f is the maximum “frequency” of an element, n is the number of sets, and m is the maximum number of elements in the universe at any point in time. (2) For the dynamic b-matching problem, we maintain an O (1)-approximately optimal solution in O (log3 n) amortized update time, where n is the number of nodes in the graph.","lang":"eng"}],"_id":"11757","doi":"10.1016/j.ic.2018.02.005","author":[{"last_name":"Bhattacharya","first_name":"Sayan","full_name":"Bhattacharya, Sayan"},{"last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H","first_name":"Monika H","orcid":"0000-0002-5008-6530"},{"last_name":"Italiano","full_name":"Italiano, Giuseppe","first_name":"Giuseppe"}],"citation":{"chicago":"Bhattacharya, Sayan, Monika H Henzinger, and Giuseppe Italiano. “Dynamic Algorithms via the Primal-Dual Method.” <i>Information and Computation</i>. Elsevier, 2018. <a href=\"https://doi.org/10.1016/j.ic.2018.02.005\">https://doi.org/10.1016/j.ic.2018.02.005</a>.","ista":"Bhattacharya S, Henzinger MH, Italiano G. 2018. Dynamic algorithms via the primal-dual method. Information and Computation. 261(08), 219–239.","apa":"Bhattacharya, S., Henzinger, M. H., &#38; Italiano, G. (2018). Dynamic algorithms via the primal-dual method. <i>Information and Computation</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ic.2018.02.005\">https://doi.org/10.1016/j.ic.2018.02.005</a>","mla":"Bhattacharya, Sayan, et al. “Dynamic Algorithms via the Primal-Dual Method.” <i>Information and Computation</i>, vol. 261, no. 08, Elsevier, 2018, pp. 219–39, doi:<a href=\"https://doi.org/10.1016/j.ic.2018.02.005\">10.1016/j.ic.2018.02.005</a>.","ama":"Bhattacharya S, Henzinger MH, Italiano G. Dynamic algorithms via the primal-dual method. <i>Information and Computation</i>. 2018;261(08):219-239. doi:<a href=\"https://doi.org/10.1016/j.ic.2018.02.005\">10.1016/j.ic.2018.02.005</a>","short":"S. Bhattacharya, M.H. Henzinger, G. Italiano, Information and Computation 261 (2018) 219–239.","ieee":"S. Bhattacharya, M. H. Henzinger, and G. Italiano, “Dynamic algorithms via the primal-dual method,” <i>Information and Computation</i>, vol. 261, no. 08. Elsevier, pp. 219–239, 2018."},"month":"08","date_created":"2022-08-08T11:20:03Z","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"status":"public","page":"219-239","intvolume":"       261","language":[{"iso":"eng"}],"issue":"08","oa_version":"Published Version","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1016/j.ic.2018.02.005"}],"scopus_import":"1","quality_controlled":"1","title":"Dynamic algorithms via the primal-dual method","date_published":"2018-08-01T00:00:00Z","publisher":"Elsevier","year":"2018","article_type":"original","day":"01"}