{"id":"https://openalex.org/W2982534635","doi":"https://doi.org/10.1145/3357713.3384247","title":"Faster energy maximization for faster maximum flow","display_name":"Faster energy maximization for faster maximum flow","publication_year":2020,"publication_date":"2020-06-07","ids":{"openalex":"https://openalex.org/W2982534635","doi":"https://doi.org/10.1145/3357713.3384247","mag":"2982534635"},"language":"en","primary_location":{"id":"doi:10.1145/3357713.3384247","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3357713.3384247","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1910.14276","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5063729451","display_name":"Yang P. Liu","orcid":"https://orcid.org/0000-0001-6717-0539"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Yang P. Liu","raw_affiliation_strings":["Stanford University, USA","Stanford University ()"],"affiliations":[{"raw_affiliation_string":"Stanford University, USA","institution_ids":["https://openalex.org/I97018004"]},{"raw_affiliation_string":"Stanford University ()","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5086787265","display_name":"Aaron Sidford","orcid":"https://orcid.org/0000-0003-2675-7610"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Aaron Sidford","raw_affiliation_strings":["Stanford University, USA","Stanford University ()"],"affiliations":[{"raw_affiliation_string":"Stanford University, USA","institution_ids":["https://openalex.org/I97018004"]},{"raw_affiliation_string":"Stanford University ()","institution_ids":["https://openalex.org/I97018004"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5063729451"],"corresponding_institution_ids":["https://openalex.org/I97018004"],"apc_list":null,"apc_paid":null,"fwci":0.1445,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.48858159,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"803","last_page":"814"},"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.9998999834060669,"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.9998999834060669,"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.9993000030517578,"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/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.7027225494384766},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6477788686752319},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5493714809417725},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.5198817253112793},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4900394678115845},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.48305588960647583},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.4691672921180725},{"id":"https://openalex.org/keywords/balanced-flow","display_name":"Balanced flow","score":0.4632856249809265},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.46061941981315613},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.4465920627117157},{"id":"https://openalex.org/keywords/energy","display_name":"Energy (signal processing)","score":0.4433766007423401},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4363923966884613},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.433283269405365},{"id":"https://openalex.org/keywords/minimum-cost-flow-problem","display_name":"Minimum-cost flow problem","score":0.4103858470916748},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.38302475214004517},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.277504563331604},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2578769326210022},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.1030537486076355},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.08464512228965759}],"concepts":[{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.7027225494384766},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6477788686752319},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5493714809417725},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.5198817253112793},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4900394678115845},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.48305588960647583},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.4691672921180725},{"id":"https://openalex.org/C167879884","wikidata":"https://www.wikidata.org/wiki/Q727568","display_name":"Balanced flow","level":2,"score":0.4632856249809265},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.46061941981315613},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.4465920627117157},{"id":"https://openalex.org/C186370098","wikidata":"https://www.wikidata.org/wiki/Q442787","display_name":"Energy (signal processing)","level":2,"score":0.4433766007423401},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4363923966884613},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.433283269405365},{"id":"https://openalex.org/C99545648","wikidata":"https://www.wikidata.org/wiki/Q2897180","display_name":"Minimum-cost flow problem","level":3,"score":0.4103858470916748},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38302475214004517},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.277504563331604},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2578769326210022},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.1030537486076355},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.08464512228965759},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/3357713.3384247","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3357713.3384247","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:1910.14276","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1910.14276","pdf_url":"https://arxiv.org/pdf/1910.14276","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},{"id":"mag:2982534635","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/1910.14276.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"doi:10.48550/arxiv.1910.14276","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1910.14276","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1910.14276","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1910.14276","pdf_url":"https://arxiv.org/pdf/1910.14276","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/7","score":0.8399999737739563,"display_name":"Affordable and clean energy"}],"awards":[{"id":"https://openalex.org/G2893785016","display_name":"CAREER: Theory of Fast Graph Optimization","funder_award_id":"1844855","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4823715754","display_name":null,"funder_award_id":"NDSEG","funder_id":"https://openalex.org/F4320306078","funder_display_name":"U.S. Department of Defense"},{"id":"https://openalex.org/G5727344453","display_name":null,"funder_award_id":"CCF-1844855","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6621079209","display_name":null,"funder_award_id":"NDSEG","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6671297155","display_name":null,"funder_award_id":"CAREER","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"},{"id":"https://openalex.org/F4320306078","display_name":"U.S. Department of Defense","ror":"https://ror.org/0447fe631"},{"id":"https://openalex.org/F4320333566","display_name":"National Defense Science and Engineering Graduate","ror":null}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2982534635.pdf","grobid_xml":"https://content.openalex.org/works/W2982534635.grobid-xml"},"referenced_works_count":67,"referenced_works":["https://openalex.org/W976211528","https://openalex.org/W1490943871","https://openalex.org/W1529411983","https://openalex.org/W1560003866","https://openalex.org/W1581300568","https://openalex.org/W1601422707","https://openalex.org/W1766210857","https://openalex.org/W1800323139","https://openalex.org/W1969357318","https://openalex.org/W1973117121","https://openalex.org/W1979505770","https://openalex.org/W1983383464","https://openalex.org/W1996169001","https://openalex.org/W2002531683","https://openalex.org/W2008292658","https://openalex.org/W2009281933","https://openalex.org/W2020899710","https://openalex.org/W2022004439","https://openalex.org/W2034841206","https://openalex.org/W2039303552","https://openalex.org/W2045107949","https://openalex.org/W2058706632","https://openalex.org/W2059630705","https://openalex.org/W2068595367","https://openalex.org/W2073647817","https://openalex.org/W2084990336","https://openalex.org/W2086867325","https://openalex.org/W2089703809","https://openalex.org/W2099463627","https://openalex.org/W2102560346","https://openalex.org/W2103099082","https://openalex.org/W2106759055","https://openalex.org/W2107780763","https://openalex.org/W2109176946","https://openalex.org/W2117595194","https://openalex.org/W2120424341","https://openalex.org/W2125664420","https://openalex.org/W2133352257","https://openalex.org/W2150516767","https://openalex.org/W2153441719","https://openalex.org/W2157529519","https://openalex.org/W2164853353","https://openalex.org/W2165956524","https://openalex.org/W2172211108","https://openalex.org/W2263976044","https://openalex.org/W2278710066","https://openalex.org/W2295766446","https://openalex.org/W2319135850","https://openalex.org/W2568484534","https://openalex.org/W2594480752","https://openalex.org/W2624960300","https://openalex.org/W2886596322","https://openalex.org/W2902172596","https://openalex.org/W2912973156","https://openalex.org/W2914016960","https://openalex.org/W2949083732","https://openalex.org/W2949824190","https://openalex.org/W2962800567","https://openalex.org/W2962921664","https://openalex.org/W2963324223","https://openalex.org/W2963751092","https://openalex.org/W2963841171","https://openalex.org/W2977307933","https://openalex.org/W2980475696","https://openalex.org/W3106163788","https://openalex.org/W4213060883","https://openalex.org/W6853854885"],"related_works":["https://openalex.org/W3034936862","https://openalex.org/W3012271343","https://openalex.org/W2517816841","https://openalex.org/W3126916987","https://openalex.org/W2952678039","https://openalex.org/W3121007904","https://openalex.org/W2950353719","https://openalex.org/W3126714247","https://openalex.org/W2475785066","https://openalex.org/W3021945058","https://openalex.org/W3125574336","https://openalex.org/W3002376889","https://openalex.org/W796163220","https://openalex.org/W2982304810","https://openalex.org/W3128057791","https://openalex.org/W2902614826","https://openalex.org/W3185359350","https://openalex.org/W2949598044","https://openalex.org/W2964757429","https://openalex.org/W2044334960"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"we":[3],"provide":[4],"an":[5],"algorithm":[6],"which":[7],"given":[8],"any":[9,26],"m-edge":[10],"n-vertex":[11],"directed":[12],"graph":[13,67],"with":[14,37],"integer":[15],"capacities":[16],"at":[17],"most":[18],"U":[19,34,51],"computes":[20],"a":[21],"maximum":[22],"s-t":[23],"flow":[24],"for":[25],"vertices":[27],"s":[28],"and":[29,61],"t":[30],"in":[31],"m":[32],"11/8+o(1)":[33],"1/4":[35],"time":[36,42],"high":[38],"probability.":[39],"This":[40],"running":[41],"improves":[43],"upon":[44],"the":[45,66],"previous":[46],"best":[47],"of":[48],"\u00d5(m":[49,55],"10/7":[50],"1/7)":[52],"(M\u0105dry":[53],"2016),":[54],"\u221an":[56],"logU)":[57],"(Lee":[58],"Sidford":[59],"2014),":[60],"O(mn)":[62],"(Orlin":[63],"2013)":[64],"when":[65],"is":[68],"not":[69],"too":[70],"dense":[71],"or":[72],"has":[73],"large":[74],"capacities.":[75]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2025-10-10T00:00:00"}