{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:26:08Z","timestamp":1750220768998,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":13,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,6,22]],"date-time":"2020-06-22T00:00:00Z","timestamp":1592784000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,6,22]]},"DOI":"10.1145\/3357713.3384285","type":"proceedings-article","created":{"date-parts":[[2020,6,7]],"date-time":"2020-06-07T01:45:25Z","timestamp":1591494325000},"page":"473-484","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["The Karger-Stein algorithm is optimal for k-cut"],"prefix":"10.1145","author":[{"given":"Anupam","family":"Gupta","sequence":"first","affiliation":[{"name":"Carnegie Mellon University, USA"}]},{"given":"Euiwoong","family":"Lee","sequence":"additional","affiliation":[{"name":"New York University, USA"}]},{"given":"Jason","family":"Li","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, USA"}]}],"member":"320","published-online":{"date-parts":[[2020,6,22]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Improved bounds for the sunflower lemma. arXiv preprint arXiv:1908.08483","author":"Alweiss Ryan","year":"2019","unstructured":"[ALWZ19] Ryan Alweiss , Shachar Lovett , Kewen Wu , and Jiapeng Zhang . Improved bounds for the sunflower lemma. arXiv preprint arXiv:1908.08483 , 2019 . [ALWZ19] Ryan Alweiss, Shachar Lovett, Kewen Wu, and Jiapeng Zhang. Improved bounds for the sunflower lemma. arXiv preprint arXiv:1908.08483, 2019."},{"key":"e_1_3_2_1_2_1","volume-title":"2nd Symposium on Simplicity in Algorithms (SOSA 2019 ). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik","author":"Chekuri Chandra","year":"2018","unstructured":"[CQX18] Chandra Chekuri , Kent Quanrud , and Chao Xu . LP relaxation and tree packing for minimum k-cuts . In 2nd Symposium on Simplicity in Algorithms (SOSA 2019 ). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik , 2018 . [CQX18] Chandra Chekuri, Kent Quanrud, and Chao Xu. LP relaxation and tree packing for minimum k-cuts. In 2nd Symposium on Simplicity in Algorithms (SOSA 2019 ). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2018."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1112\/jlms\/s1-35.1.85"},{"key":"e_1_3_2_1_4_1","volume-title":"On tail probabilities for martingales. the Annals of Probability, 3 ( 1 ): 100-118","author":"Freedman David A","year":"1975","unstructured":"[Fre75] David A Freedman . On tail probabilities for martingales. the Annals of Probability, 3 ( 1 ): 100-118 , 1975 . [Fre75] David A Freedman. On tail probabilities for martingales. the Annals of Probability, 3 ( 1 ): 100-118, 1975."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/2797333.2797336"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2018.00020"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3313276.3316395"},{"key":"e_1_3_2_1_8_1","volume-title":"Karger and Cliford Stein. A new approach to the minimum cut problem. Journal of the ACM (JACM), 43 ( 4 ): 601-640","author":"David","year":"1996","unstructured":"[KS96] David R. Karger and Cliford Stein. A new approach to the minimum cut problem. Journal of the ACM (JACM), 43 ( 4 ): 601-640 , 1996 . [KS96] David R. Karger and Cliford Stein. A new approach to the minimum cut problem. Journal of the ACM (JACM), 43 ( 4 ): 601-640, 1996."},{"key":"e_1_3_2_1_9_1","first-page":"1329","volume":"36","author":"Kamidoi Yoko","year":"2006","unstructured":"[KYN07] Yoko Kamidoi , Noriyoshi Yoshida , and Hiroshi Nagamochi . A deterministic algorithm for finding all minimum k-way cuts. SIAM J. Comput. , 36 ( 5 ): 1329 - 1341 , 2006 \/07. [KYN07] Yoko Kamidoi, Noriyoshi Yoshida, and Hiroshi Nagamochi. A deterministic algorithm for finding all minimum k-way cuts. SIAM J. Comput., 36 ( 5 ): 1329-1341, 2006 \/07.","journal-title":"J. Comput."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2019.00068"},{"key":"e_1_3_2_1_11_1","series-title":"SIAM J. Discrete Math., 5 ( 1 ): 54-66","volume-title":"Computing edge-connectivity in multigraphs and capacitated graphs","author":"Nagamochi Hiroshi","year":"1992","unstructured":"[NI92] Hiroshi Nagamochi and Toshihide Ibaraki . Computing edge-connectivity in multigraphs and capacitated graphs . SIAM J. Discrete Math., 5 ( 1 ): 54-66 , 1992 . [NI92] Hiroshi Nagamochi and Toshihide Ibaraki. Computing edge-connectivity in multigraphs and capacitated graphs. SIAM J. Discrete Math., 5 ( 1 ): 54-66, 1992."},{"key":"e_1_3_2_1_12_1","volume-title":"Fast and deterministic approximations for k-cut. arXiv preprint arXiv","author":"Quanrud Kent","year":"1807","unstructured":"[Qua18] Kent Quanrud . Fast and deterministic approximations for k-cut. arXiv preprint arXiv : 1807 .07143, 2018. [Qua18] Kent Quanrud. Fast and deterministic approximations for k-cut. arXiv preprint arXiv: 1807.07143, 2018."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374402"}],"event":{"name":"STOC '20: 52nd Annual ACM SIGACT Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Chicago IL USA","acronym":"STOC '20"},"container-title":["Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3357713.3384285","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3357713.3384285","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:41:12Z","timestamp":1750200072000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3357713.3384285"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,22]]},"references-count":13,"alternative-id":["10.1145\/3357713.3384285","10.1145\/3357713"],"URL":"https:\/\/doi.org\/10.1145\/3357713.3384285","relation":{},"subject":[],"published":{"date-parts":[[2020,6,22]]},"assertion":[{"value":"2020-06-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}