{"date_published":"2022-11-17T00:00:00Z","date_created":"2023-08-25T15:04:29Z","oa":1,"author":[{"full_name":"Goranci, Gramoz","first_name":"Gramoz","last_name":"Goranci"},{"last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H"}],"month":"11","year":"2022","extern":"1","language":[{"iso":"eng"}],"article_processing_charge":"No","title":"Incremental approximate maximum flow in m1/2+o(1) update time","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2211.09606","open_access":"1"}],"doi":"10.48550/arXiv.2211.09606","publication_status":"submitted","_id":"14236","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication":"arXiv","article_number":"2211.09606","day":"17","oa_version":"Preprint","external_id":{"arxiv":["2211.09606"]},"date_updated":"2023-09-04T08:31:19Z","abstract":[{"lang":"eng","text":"We show an $(1+\\epsilon)$-approximation algorithm for maintaining maximum $s$-$t$ flow under $m$ edge insertions in $m^{1/2+o(1)} \\epsilon^{-1/2}$ amortized update time for directed, unweighted graphs. This constitutes the first sublinear dynamic maximum flow algorithm in general sparse graphs with arbitrarily good approximation guarantee."}],"citation":{"ieee":"G. Goranci and M. H. Henzinger, “Incremental approximate maximum flow in m1/2+o(1) update time,” <i>arXiv</i>. .","chicago":"Goranci, Gramoz, and Monika H Henzinger. “Incremental Approximate Maximum Flow in M1/2+o(1) Update Time.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2211.09606\">https://doi.org/10.48550/arXiv.2211.09606</a>.","ama":"Goranci G, Henzinger MH. Incremental approximate maximum flow in m1/2+o(1) update time. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2211.09606\">10.48550/arXiv.2211.09606</a>","short":"G. Goranci, M.H. Henzinger, ArXiv (n.d.).","mla":"Goranci, Gramoz, and Monika H. Henzinger. “Incremental Approximate Maximum Flow in M1/2+o(1) Update Time.” <i>ArXiv</i>, 2211.09606, doi:<a href=\"https://doi.org/10.48550/arXiv.2211.09606\">10.48550/arXiv.2211.09606</a>.","apa":"Goranci, G., &#38; Henzinger, M. H. (n.d.). Incremental approximate maximum flow in m1/2+o(1) update time. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2211.09606\">https://doi.org/10.48550/arXiv.2211.09606</a>","ista":"Goranci G, Henzinger MH. Incremental approximate maximum flow in m1/2+o(1) update time. arXiv, 2211.09606."},"type":"preprint"}