{"day":"01","quality_controlled":"1","date_updated":"2023-02-10T07:27:39Z","intvolume":"       261","status":"public","abstract":[{"lang":"eng","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."}],"main_file_link":[{"url":"https://doi.org/10.1016/j.ic.2018.02.005","open_access":"1"}],"extern":"1","volume":261,"article_type":"original","year":"2018","date_published":"2018-08-01T00:00:00Z","article_processing_charge":"No","publication":"Information and Computation","date_created":"2022-08-08T11:20:03Z","page":"219-239","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"author":[{"last_name":"Bhattacharya","full_name":"Bhattacharya, Sayan","first_name":"Sayan"},{"full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","first_name":"Monika H","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"},{"last_name":"Italiano","first_name":"Giuseppe","full_name":"Italiano, Giuseppe"}],"publication_status":"published","oa":1,"scopus_import":"1","publisher":"Elsevier","oa_version":"Published Version","citation":{"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>","short":"S. Bhattacharya, M.H. Henzinger, G. Italiano, Information and Computation 261 (2018) 219–239.","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>.","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.","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.","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>"},"type":"journal_article","doi":"10.1016/j.ic.2018.02.005","publication_identifier":{"issn":["0890-5401"]},"_id":"11757","issue":"08","month":"08","title":"Dynamic algorithms via the primal-dual method"}