{"id":"https://openalex.org/W3170659189","doi":"https://doi.org/10.1145/3406325.3451112","title":"Approximate Gomory\u2013Hu tree is faster than <i>n</i> \u2013 1 max-flows","display_name":"Approximate Gomory\u2013Hu tree is faster than <i>n</i> \u2013 1 max-flows","publication_year":2021,"publication_date":"2021-06-15","ids":{"openalex":"https://openalex.org/W3170659189","doi":"https://doi.org/10.1145/3406325.3451112","mag":"3170659189"},"language":"en","primary_location":{"id":"doi:10.1145/3406325.3451112","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3406325.3451112","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3406325.3451112","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3406325.3451112","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5100762970","display_name":"Jason Li","orcid":"https://orcid.org/0000-0002-1150-3549"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Jason Li","raw_affiliation_strings":["Carnegie Mellon University, USA"],"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5087182068","display_name":"Debmalya Panigrahi","orcid":"https://orcid.org/0000-0003-1799-6660"},"institutions":[{"id":"https://openalex.org/I170897317","display_name":"Duke University","ror":"https://ror.org/00py81415","country_code":"US","type":"education","lineage":["https://openalex.org/I170897317"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Debmalya Panigrahi","raw_affiliation_strings":["Duke University, USA"],"affiliations":[{"raw_affiliation_string":"Duke University, USA","institution_ids":["https://openalex.org/I170897317"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5100762970"],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":null,"apc_paid":null,"fwci":1.5147,"has_fulltext":true,"cited_by_count":15,"citation_normalized_percentile":{"value":0.84899422,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":95,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1738","last_page":"1748"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9955000281333923,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9939000010490417,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7221381664276123},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.632165253162384},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6134527921676636},{"id":"https://openalex.org/keywords/dual-graph","display_name":"Dual graph","score":0.5939936637878418},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5931426286697388},{"id":"https://openalex.org/keywords/gomory\u2013hu-tree","display_name":"Gomory\u2013Hu tree","score":0.47311875224113464},{"id":"https://openalex.org/keywords/duality","display_name":"Duality (order theory)","score":0.46477964520454407},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.45395156741142273},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4503544270992279},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.44478943943977356},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.3457258343696594},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32625800371170044},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.17769965529441833},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.1364978551864624},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.05667990446090698}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7221381664276123},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.632165253162384},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6134527921676636},{"id":"https://openalex.org/C169827030","wikidata":"https://www.wikidata.org/wiki/Q2294516","display_name":"Dual graph","level":4,"score":0.5939936637878418},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5931426286697388},{"id":"https://openalex.org/C147517495","wikidata":"https://www.wikidata.org/wiki/Q5581241","display_name":"Gomory\u2013Hu tree","level":5,"score":0.47311875224113464},{"id":"https://openalex.org/C2778023678","wikidata":"https://www.wikidata.org/wiki/Q554403","display_name":"Duality (order theory)","level":2,"score":0.46477964520454407},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.45395156741142273},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4503544270992279},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.44478943943977356},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.3457258343696594},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32625800371170044},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.17769965529441833},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.1364978551864624},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.05667990446090698}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3406325.3451112","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3406325.3451112","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3406325.3451112","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3406325.3451112","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3406325.3451112","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3406325.3451112","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1068153873","display_name":null,"funder_award_id":"CCF-2006953","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G1082722339","display_name":null,"funder_award_id":"CCF-1750140","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G1163701979","display_name":null,"funder_award_id":"CCF-1955785","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G1338653207","display_name":"Collaborative Research: AF: Small: Combinatorial Optimization for Stochastic Inputs","funder_award_id":"2006953","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3409407142","display_name":null,"funder_award_id":"CCF-1907820","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3975607665","display_name":"Collaborative Research: AF: Medium: Algorithms Meet Machine Learning: Mitigating Uncertainty in Optimization","funder_award_id":"1955703","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4606594371","display_name":"AF: Small: New Approaches for Approximation and Online Algorithms","funder_award_id":"1907820","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5226018963","display_name":"CAREER: New Directions in Graph Algorithms","funder_award_id":"1750140","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5827601135","display_name":"Collaborative Research: AF: Medium: Algorithms Meet Machine Learning: Mitigating Uncertainty in Optimization","funder_award_id":"1955785","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3170659189.pdf","grobid_xml":"https://content.openalex.org/works/W3170659189.grobid-xml"},"referenced_works_count":16,"referenced_works":["https://openalex.org/W1502199009","https://openalex.org/W1543491698","https://openalex.org/W1980410492","https://openalex.org/W1986207529","https://openalex.org/W2028643523","https://openalex.org/W2043428092","https://openalex.org/W2084990336","https://openalex.org/W2115049345","https://openalex.org/W2146409551","https://openalex.org/W2958706771","https://openalex.org/W3000811701","https://openalex.org/W3086568661","https://openalex.org/W3127894499","https://openalex.org/W4213060883","https://openalex.org/W4255005259","https://openalex.org/W6755448717"],"related_works":["https://openalex.org/W130518292","https://openalex.org/W1514905840","https://openalex.org/W2020381385","https://openalex.org/W3139707633","https://openalex.org/W1997570556","https://openalex.org/W4366958292","https://openalex.org/W2773952922","https://openalex.org/W2186771076","https://openalex.org/W2015718828","https://openalex.org/W2202852987"],"abstract_inverted_index":{"The":[0],"Gomory-Hu":[1,60,87],"tree":[2,5,88],"or":[3],"cut":[4],"(Gomory":[6],"and":[7,33,40,79],"Hu,":[8],"1961)":[9],"is":[10],"a":[11,85],"classic":[12],"data":[13],"structure":[14],"for":[15,27,59,68,83],"reporting":[16],"s\u2212t":[17,25],"mincuts":[18],"(and":[19],"by":[20],"duality,":[21],"the":[22,56,96],"values":[23],"of":[24,30],"maxflows)":[26],"all":[28],"pairs":[29],"vertices":[31],"s":[32],"t":[34],"in":[35],"an":[36,81],"undirected":[37],"graph.":[38],"Gomory":[39],"Hu":[41],"showed":[42],"that":[43],"it":[44],"can":[45],"be":[46],"computed":[47],"using":[48,89],"n\u22121":[49],"exact":[50],"maxflow":[51,91],"computations.":[52,92],"Surprisingly,":[53],"this":[54,72,76],"remains":[55],"best":[57],"algorithm":[58,82],"trees":[61],"more":[62],"than":[63],"50":[64],"years":[65],"later,":[66],"even":[67],"approximate":[69],"mincuts.":[70],"In":[71],"paper,":[73],"we":[74,94,99],"break":[75],"longstanding":[77],"barrier":[78],"give":[80],"computing":[84],"(1+\u0454)-approximate":[86],"log(n)":[90],"Specifically,":[93],"obtain":[95],"runtime":[97],"bounds":[98],"describe":[100],"below.":[101]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":4},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":3}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}