{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,2]],"date-time":"2026-03-02T16:16:54Z","timestamp":1772468214556,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":18,"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:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,6,15]]},"DOI":"10.1145\/3406325.3451112","type":"proceedings-article","created":{"date-parts":[[2021,6,16]],"date-time":"2021-06-16T01:26:13Z","timestamp":1623806773000},"page":"1738-1748","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["Approximate Gomory\u2013Hu tree is faster than\n            <i>n<\/i>\n            \u2013 1 max-flows"],"prefix":"10.1145","author":[{"given":"Jason","family":"Li","sequence":"first","affiliation":[{"name":"Carnegie Mellon University, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Debmalya","family":"Panigrahi","sequence":"additional","affiliation":[{"name":"Duke University, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,6,15]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS46700.2020.00019"},{"key":"e_1_3_2_1_2_1","first-page":"61","volume-title":"Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020","author":"Abboud Amir","year":"2020","unstructured":"Amir Abboud, Robert Krauthgamer, Ohad Trabelsi, and Shuchi Chawla. 2020. New Algorithms and Lower Bounds for All-Pairs Max-Flow in Undirected Graphs. In Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, Salt Lake City, UT, USA, January 5-8, 2020. SIAM. Pages 48\u201361."},{"key":"e_1_3_2_1_3_1","volume-title":"Approximate s-t Min-Cuts in \\tilde O (n^2) time. 44, 2","author":"Karger Andr\u00e1s A","year":"2015","unstructured":"Andr\u00e1s A Bencz\\'ur and David R Karger. 2015. Approximate s-t Min-Cuts in \\tilde O (n^2) time. 44, 2, 2015. Pages 290\u2013319."},{"key":"e_1_3_2_1_4_1","first-page":"2","article-title":"Randomized Approximation Schemes for Cuts and Flows in Capacitated Graphs","volume":"44","author":"Karger Andr\u00e1s A.","year":"2015","unstructured":"Andr\u00e1s A. Bencz\\'ur and David R. Karger. 2015. Randomized Approximation Schemes for Cuts and Flows in Capacitated Graphs. SIAM J. Comput., 44, 2, 2015. Pages 290\u2013319.","journal-title":"SIAM J. Comput."},{"key":"e_1_3_2_1_5_1","first-page":"464","volume-title":"Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008","author":"Bhalgat Anand","year":"2008","unstructured":"Anand Bhalgat, Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi, and Shang-Hua Teng. [n.d.]. Fast edge splitting and Edmonds' arborescence construction for unweighted graphs. In Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008. Pages 455\u2013464."},{"key":"e_1_3_2_1_6_1","volume-title":"All-Pairs Minimum Cuts in Near-Linear Time for Surface-Embedded Graphs. In 32nd International Symposium on Computational Geometry, SoCG 2016","author":"Borradaile Glencora","year":"2016","unstructured":"Glencora Borradaile, David Eppstein, Amir Nayyeri, Christian Wulff-Nilsen, S\u00e1ndor P. Fekete, and Anna Lubiw. 2016. All-Pairs Minimum Cuts in Near-Linear Time for Surface-Embedded Graphs. In 32nd International Symposium on Computational Geometry, SoCG 2016, June 14-18, 2016, Boston, MA, USA. LIPIcs. 51, Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik. Pages 22:1\u201322:16."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2684068"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1956-045-5"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/16M1091666"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.2000.1136"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/0109047"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/0219009"},{"key":"e_1_3_2_1_13_1","first-page":"136","volume-title":"Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007","author":"Hariharan Ramesh","year":"2007","unstructured":"Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi, Nikhil Bansal, Kirk Pruhs, and Clifford Stein. 2007. Efficient algorithms for computing all low s-t edge connectivities and related problems. In Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, New Orleans, Louisiana, USA, January 7-9, 2007. SIAM. Pages 127\u2013136."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/070705994"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.52"},{"key":"e_1_3_2_1_16_1","volume-title":"Deterministic Min-cut in Poly-logarithmic Max-flows. In 61st IEEE Annual Symposium on Foundations of Computer Science, FOCS","author":"Li Jason","year":"2020","unstructured":"Jason Li and Debmalya Panigrahi. 2020. Deterministic Min-cut in Poly-logarithmic Max-flows. In 61st IEEE Annual Symposium on Foundations of Computer Science, FOCS 2020. IEEE Computer Society."},{"key":"e_1_3_2_1_17_1","volume-title":"Faster Divergence Maximization for Faster Maximum Flow. arXiv preprint arXiv:2003.08929","author":"Liu Yang P","year":"2020","unstructured":"Yang P Liu and Aaron Sidford. 2020. Faster Divergence Maximization for Faster Maximum Flow. arXiv preprint arXiv:2003.08929, 2020."},{"key":"e_1_3_2_1_18_1","volume-title":"Encyclopedia of Algorithms. Pages 858\u2013861.","author":"Panigrahi Debmalya","unstructured":"Debmalya Panigrahi. 2016. Gomory-Hu Trees. In Encyclopedia of Algorithms. Pages 858\u2013861."}],"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.3451112","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3406325.3451112","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:24:53Z","timestamp":1750195493000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3406325.3451112"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,15]]},"references-count":18,"alternative-id":["10.1145\/3406325.3451112","10.1145\/3406325"],"URL":"https:\/\/doi.org\/10.1145\/3406325.3451112","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"}}]}}