{"status":"public","date_updated":"2025-07-14T09:00:22Z","arxiv":1,"language":[{"iso":"eng"}],"OA_place":"repository","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2412.15069","open_access":"1"}],"project":[{"name":"The design and evaluation of modern fully dynamic data structures","_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62","grant_number":"101019564","call_identifier":"H2020"},{"_id":"34def286-11ca-11ed-8bc3-da5948e1613c","name":"Efficient algorithms","grant_number":"Z00422"},{"grant_number":"I05982","_id":"bda196b2-d553-11ed-ba76-8e8ee6c21103","name":"Static and Dynamic Hierarchical Graph Decompositions"},{"grant_number":"P33775","_id":"bd9e3a2e-d553-11ed-ba76-8aa684ce17fe","name":"Fast Algorithms for a Reactive Network Layer"}],"department":[{"_id":"E-Lib"}],"_id":"19982","page":"750-784","author":[{"last_name":"El-Hayek","first_name":"Antoine","full_name":"El-Hayek, Antoine","id":"888a098e-fcac-11ee-aff7-d347be57b725","orcid":"0000-0003-4268-7368"},{"full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","last_name":"Henzinger","first_name":"Monika H"},{"last_name":"Li","first_name":"Jason","full_name":"Li, Jason"}],"oa_version":"Preprint","type":"conference","ec_funded":1,"acknowledgement":"This project has received funding from the European Research Council (ERC) under the European Union’sHorizon 2020 research and innovation programme (MoDynStruct, No. 101019564) and the Austrian Science Fund(FWF) grant DOI 10.55776/Z422, grant DOI 10.55776/I5982, and grant DOI 10.55776/P33775 with additional funding from the netidee SCIENCE Stiftung, 2020–2024.","conference":{"start_date":"2025-01-12","location":"New Orleans, LA, United States","name":"SODA: Symposium on Discrete Algorithms","end_date":"2025-01-15"},"quality_controlled":"1","oa":1,"abstract":[{"lang":"eng","text":"Dynamically maintaining the minimum cut in a graph G under edge insertions and deletion is a fundamental problem in dynamic graph algorithms for which no conditional lower bound on the time per operation exists. In an n-node graph the best known (1 + o (1))-approximate algorithm takes  update time [14]. If the minimum cut is guaranteed to be (log n )o (1), a deterministic exact algorithm with n o (1) update time exists [8].\r\nWe present the first fully dynamic algorithm for (1 + o (1))-approximate minimum cut with n o(1) update time. Our main technical contribution is to show that it suffices to consider small-volume cuts in suitably contracted graphs."}],"citation":{"short":"A. El-Hayek, M. Henzinger, J. Li, in:, Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2025, pp. 750–784.","mla":"El-Hayek, Antoine, et al. “Fully Dynamic Approximate Minimum Cut in Subpolynomial Time per Operation.” <i>Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms</i>, Society for Industrial and Applied Mathematics, 2025, pp. 750–84, doi:<a href=\"https://doi.org/10.1137/1.9781611978322.22\">10.1137/1.9781611978322.22</a>.","apa":"El-Hayek, A., Henzinger, M., &#38; Li, J. (2025). Fully dynamic approximate minimum cut in subpolynomial time per operation. In <i>Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms</i> (pp. 750–784). New Orleans, LA, United States: Society for Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1137/1.9781611978322.22\">https://doi.org/10.1137/1.9781611978322.22</a>","ista":"El-Hayek A, Henzinger M, Li J. 2025. Fully dynamic approximate minimum cut in subpolynomial time per operation. Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 750–784.","ieee":"A. El-Hayek, M. Henzinger, and J. Li, “Fully dynamic approximate minimum cut in subpolynomial time per operation,” in <i>Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms</i>, New Orleans, LA, United States, 2025, pp. 750–784.","ama":"El-Hayek A, Henzinger M, Li J. Fully dynamic approximate minimum cut in subpolynomial time per operation. In: <i>Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms</i>. Society for Industrial and Applied Mathematics; 2025:750-784. doi:<a href=\"https://doi.org/10.1137/1.9781611978322.22\">10.1137/1.9781611978322.22</a>","chicago":"El-Hayek, Antoine, Monika Henzinger, and Jason Li. “Fully Dynamic Approximate Minimum Cut in Subpolynomial Time per Operation.” In <i>Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms</i>, 750–84. Society for Industrial and Applied Mathematics, 2025. <a href=\"https://doi.org/10.1137/1.9781611978322.22\">https://doi.org/10.1137/1.9781611978322.22</a>."},"day":"07","title":"Fully dynamic approximate minimum cut in subpolynomial time per operation","publication_identifier":{"eisbn":["9781611978322"]},"publisher":"Society for Industrial and Applied Mathematics","date_published":"2025-01-07T00:00:00Z","publication_status":"published","corr_author":"1","publication":"Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms","doi":"10.1137/1.9781611978322.22","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"01","year":"2025","date_created":"2025-07-10T13:08:57Z","OA_type":"green","external_id":{"arxiv":["2412.15069"]}}