{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T10:19:25Z","timestamp":1781259565857,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,6,15]],"date-time":"2021-06-15T00:00:00Z","timestamp":1623715200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["715672"],"award-info":[{"award-number":["715672"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,6,15]]},"DOI":"10.1145\/3406325.3451020","type":"proceedings-article","created":{"date-parts":[[2021,6,16]],"date-time":"2021-06-16T01:26:13Z","timestamp":1623806773000},"page":"1144-1153","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":16,"title":["Distributed weighted min-cut in nearly-optimal time"],"prefix":"10.1145","author":[{"given":"Michal","family":"Dory","sequence":"first","affiliation":[{"name":"ETH Zurich, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yuval","family":"Efron","sequence":"additional","affiliation":[{"name":"University of Toronto, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3722-4679","authenticated-orcid":false,"given":"Sagnik","family":"Mukhopadhyay","sequence":"additional","affiliation":[{"name":"KTH, Sweden"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4468-2675","authenticated-orcid":false,"given":"Danupon","family":"Nanongkai","sequence":"additional","affiliation":[{"name":"University of Copenhagen, Denmark \/ KTH, Sweden"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2021,6,15]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"32nd International Symposium on Distributed Computing (DISC 2018","author":"Ahmadi Mohamad","year":"2018","unstructured":"Mohamad Ahmadi, Fabian Kuhn, and Rotem Oshman. Distributed approximate maximum matching in the congest model. In 32nd International Symposium on Distributed Computing (DISC 2018). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2018."},{"key":"e_1_3_2_1_2_1","first-page":"16","volume-title":"DISC","volume":"91","author":"Becker Ruben","year":"2017","unstructured":"Ruben Becker, Andreas Karrenbauer, Sebastian Krinninger, and Christoph Lenzen. Near-optimal approximate shortest paths and transshipment in distributed and streaming models. In DISC, volume 91, pages 7:1\u20137:16, 2017."},{"key":"e_1_3_2_1_3_1","volume-title":"Distributed weighted min-cut in nearly-optimal time. CoRR, abs\/2004.09129","author":"Dory Michal","year":"2020","unstructured":"Michal Dory, Yuval Efron, Sagnik Mukhopadhyay, and Danupon Nanongkai. Distributed weighted min-cut in nearly-optimal time. CoRR, abs\/2004.09129, 2020."},{"key":"e_1_3_2_1_4_1","first-page":"372","volume-title":"STOC","author":"Sarma Atish Das","year":"2011","unstructured":"Atish Das Sarma, Stephan Holzer, Liah Kor, Amos Korman, Danupon Nanongkai, Gopal Pandurangan, David Peleg, and Roger Wattenhofer. Distributed verification and hardness of distributed approximation. In STOC, pages 363\u2013372, 2011."},{"key":"e_1_3_2_1_5_1","first-page":"354","volume-title":"STOC","author":"Daga Mohit","unstructured":"Mohit Daga, Monika Henzinger, Danupon Nanongkai, and Thatchaphol Saranurak. Distributed edge connectivity in sublinear time. In STOC, pages 343\u2013354. ACM, 2019."},{"key":"e_1_3_2_1_6_1","first-page":"158","volume-title":"PODC","author":"Dory Michal","unstructured":"Michal Dory. Distributed approximation of minimum k-edge-connected spanning subgraphs. In PODC, pages 149\u2013158. ACM, 2018."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1956.1056816"},{"key":"e_1_3_2_1_8_1","first-page":"175","volume-title":"PODC","author":"Elkin Michael","unstructured":"Michael Elkin, Hartmut Klauck, Danupon Nanongkai, and Gopal Pandurangan. Can quantum communication speed up distributed computation? In PODC, pages 166\u2013175. ACM, 2014."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539704441058"},{"key":"e_1_3_2_1_10_1","volume-title":"Birkh\u00e4user Boston","author":"Ford L. R.","year":"1987","unstructured":"L. R. Ford and D. R. Fulkerson. Maximal Flow Through a Network, pages 243\u2013248. Birkh\u00e4user Boston, Boston, MA, 1987."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3210377.3210393"},{"key":"e_1_3_2_1_12_1","first-page":"219","volume-title":"SODA","author":"Ghaffari Mohsen","unstructured":"Mohsen Ghaffari and Bernhard Haeupler. Distributed algorithms for planar networks II: low-congestion shortcuts, mst, and min-cut. In SODA, pages 202\u2013219. SIAM, 2016."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-41527-2_1"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2767386.2767440"},{"key":"e_1_3_2_1_15_1","first-page":"15","volume-title":"ICALP 2020","author":"Gawrychowski Pawel","year":"2020","unstructured":"Pawel Gawrychowski, Shay Mozes, and Oren Weimann. Minimum cut in o(m log\\(^2\\) n) time. In ICALP 2020, pages 57:1\u201357:15, 2020."},{"key":"e_1_3_2_1_16_1","first-page":"366","volume-title":"PODC","author":"Ghaffari Mohsen","unstructured":"Mohsen Ghaffari and Krzysztof Nowicki. Congested clique algorithms for the minimum cut problem. In PODC, pages 357\u2013366. ACM, 2018."},{"key":"e_1_3_2_1_17_1","first-page":"1279","volume-title":"SODA","author":"Ghaffari Mohsen","unstructured":"Mohsen Ghaffari, Krzysztof Nowicki, and Mikkel Thorup. Faster algorithms for edge connectivity via random 2-out contractions. In SODA, pages 1260\u20131279. SIAM, 2020."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2935764.2935795"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897638"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/331605.331608"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-013-9479-7"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384334"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591850"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-45174-8_30"},{"key":"e_1_3_2_1_25_1","volume-title":"Small cuts and connectivity certificates: A fault tolerant approach","author":"Parter Merav","year":"2019","unstructured":"Merav Parter. Small cuts and connectivity certificates: A fault tolerant approach. 2019."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539700369740"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2000807.2000814"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-007-0045-2"}],"event":{"name":"STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing","location":"Virtual Italy","acronym":"STOC '21","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3406325.3451020","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3406325.3451020","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:01:44Z","timestamp":1750197704000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3406325.3451020"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,15]]},"references-count":28,"alternative-id":["10.1145\/3406325.3451020","10.1145\/3406325"],"URL":"https:\/\/doi.org\/10.1145\/3406325.3451020","relation":{},"subject":[],"published":{"date-parts":[[2021,6,15]]},"assertion":[{"value":"2021-06-15","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}