{"external_id":{"arxiv":["1611.06500"]},"language":[{"iso":"eng"}],"status":"public","day":"18","publication":"24th Annual European Symposium on Algorithms","_id":"11834","scopus_import":"1","date_created":"2022-08-12T10:58:32Z","month":"08","publication_identifier":{"issn":["1868-8969"],"isbn":["978-3-95977-015-6"]},"article_number":"46","publication_status":"published","date_published":"2016-08-18T00:00:00Z","article_processing_charge":"No","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","author":[{"last_name":"Goranci","first_name":"Gramoz","full_name":"Goranci, Gramoz"},{"last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","first_name":"Monika H"},{"first_name":"Mikkel","full_name":"Thorup, Mikkel","last_name":"Thorup"}],"oa_version":"Published Version","alternative_title":["LIPIcs"],"conference":{"name":"ESA: Annual European Symposium on Algorithms","location":"Aarhus, Denmark","start_date":"2016-08-22","end_date":"2016-08-24"},"citation":{"mla":"Goranci, Gramoz, et al. “Incremental Exact Min-Cut in Poly-Logarithmic Amortized Update Time.” <i>24th Annual European Symposium on Algorithms</i>, vol. 57, 46, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016, doi:<a href=\"https://doi.org/10.4230/LIPICS.ESA.2016.46\">10.4230/LIPICS.ESA.2016.46</a>.","ista":"Goranci G, Henzinger MH, Thorup M. 2016. Incremental exact min-cut in poly-logarithmic amortized update time. 24th Annual European Symposium on Algorithms. ESA: Annual European Symposium on Algorithms, LIPIcs, vol. 57, 46.","short":"G. Goranci, M.H. Henzinger, M. Thorup, in:, 24th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016.","chicago":"Goranci, Gramoz, Monika H Henzinger, and Mikkel Thorup. “Incremental Exact Min-Cut in Poly-Logarithmic Amortized Update Time.” In <i>24th Annual European Symposium on Algorithms</i>, Vol. 57. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016. <a href=\"https://doi.org/10.4230/LIPICS.ESA.2016.46\">https://doi.org/10.4230/LIPICS.ESA.2016.46</a>.","ieee":"G. Goranci, M. H. Henzinger, and M. Thorup, “Incremental exact min-cut in poly-logarithmic amortized update time,” in <i>24th Annual European Symposium on Algorithms</i>, Aarhus, Denmark, 2016, vol. 57.","ama":"Goranci G, Henzinger MH, Thorup M. Incremental exact min-cut in poly-logarithmic amortized update time. In: <i>24th Annual European Symposium on Algorithms</i>. Vol 57. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2016. doi:<a href=\"https://doi.org/10.4230/LIPICS.ESA.2016.46\">10.4230/LIPICS.ESA.2016.46</a>","apa":"Goranci, G., Henzinger, M. H., &#38; Thorup, M. (2016). Incremental exact min-cut in poly-logarithmic amortized update time. In <i>24th Annual European Symposium on Algorithms</i> (Vol. 57). Aarhus, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPICS.ESA.2016.46\">https://doi.org/10.4230/LIPICS.ESA.2016.46</a>"},"doi":"10.4230/LIPICS.ESA.2016.46","type":"conference","extern":"1","intvolume":"        57","title":"Incremental exact min-cut in poly-logarithmic amortized update time","date_updated":"2023-02-16T12:05:59Z","main_file_link":[{"open_access":"1","url":"https://doi.org/10.4230/LIPIcs.ESA.2016.46"}],"volume":57,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"quality_controlled":"1","abstract":[{"text":"We present a deterministic incremental algorithm for exactly maintaining the size of a minimum cut with ~O(1) amortized time per edge insertion and O(1) query time. This result partially answers an open question posed by Thorup [Combinatorica 2007]. It also stays in sharp contrast to a polynomial conditional lower-bound for the fully-dynamic weighted minimum cut problem. Our algorithm is obtained by combining a recent sparsification technique of Kawarabayashi and Thorup [STOC 2015] and an exact incremental algorithm of Henzinger [J. of Algorithm 1997].\r\n\r\nWe also study space-efficient incremental algorithms for the minimum cut problem. Concretely, we show that there exists an O(n log n/epsilon^2) space Monte-Carlo algorithm that can process a stream of edge insertions starting from an empty graph, and with high probability, the algorithm maintains a (1+epsilon)-approximation to the minimum cut. The algorithm has ~O(1) amortized update-time and constant query-time.","lang":"eng"}],"year":"2016"}