{"status":"public","oa_version":"Preprint","date_updated":"2023-09-04T08:31:19Z","publication_status":"submitted","publication":"arXiv","type":"preprint","date_published":"2022-11-17T00:00:00Z","citation":{"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>.","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>.","ieee":"G. Goranci and M. H. Henzinger, “Incremental approximate maximum flow in m1/2+o(1) update time,” <i>arXiv</i>. .","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>","ista":"Goranci G, Henzinger MH. Incremental approximate maximum flow in m1/2+o(1) update time. arXiv, 2211.09606.","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>"},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2211.09606"}],"extern":"1","year":"2022","month":"11","day":"17","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Gramoz","last_name":"Goranci","full_name":"Goranci, Gramoz"},{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H","last_name":"Henzinger","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H"}],"date_created":"2023-08-25T15:04:29Z","_id":"14236","abstract":[{"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.","lang":"eng"}],"oa":1,"title":"Incremental approximate maximum flow in m1/2+o(1) update time","language":[{"iso":"eng"}],"doi":"10.48550/arXiv.2211.09606","external_id":{"arxiv":["2211.09606"]},"article_processing_charge":"No","article_number":"2211.09606"}