{"id":"https://openalex.org/W4224133915","doi":"https://doi.org/10.1137/20m1383525","title":"Unit Capacity Maxflow in Almost $m^{4/3}$ Time","display_name":"Unit Capacity Maxflow in Almost $m^{4/3}$ Time","publication_year":2022,"publication_date":"2022-04-18","ids":{"openalex":"https://openalex.org/W4224133915","doi":"https://doi.org/10.1137/20m1383525"},"language":"en","primary_location":{"id":"doi:10.1137/20m1383525","is_oa":false,"landing_page_url":"https://doi.org/10.1137/20m1383525","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5015882189","display_name":"Tarun Kathuria","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Tarun Kathuria","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5063729451","display_name":"Yang P. Liu","orcid":"https://orcid.org/0000-0001-6717-0539"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yang P. Liu","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5086787265","display_name":"Aaron Sidford","orcid":"https://orcid.org/0000-0003-2675-7610"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Aaron Sidford","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5015882189"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.9052,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.7636939,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"53","issue":"6","first_page":"FOCS20","last_page":"175"},"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.9997000098228455,"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.9997000098228455,"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.9993000030517578,"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"}},{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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.7973070740699768},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.7594724893569946},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.714110255241394},{"id":"https://openalex.org/keywords/rounding","display_name":"Rounding","score":0.664959192276001},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.6113296151161194},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.5040746927261353},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.49302956461906433},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.4922293722629547},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4598231613636017},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.42454642057418823},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.08584162592887878}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7973070740699768},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.7594724893569946},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.714110255241394},{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.664959192276001},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.6113296151161194},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.5040746927261353},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.49302956461906433},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4922293722629547},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4598231613636017},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42454642057418823},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.08584162592887878},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/20m1383525","is_oa":false,"landing_page_url":"https://doi.org/10.1137/20m1383525","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5456002327","display_name":null,"funder_award_id":"CCF 1718695","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"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"}],"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"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W1560003866","https://openalex.org/W1632601927","https://openalex.org/W1968307589","https://openalex.org/W1973117121","https://openalex.org/W1983383464","https://openalex.org/W1996169001","https://openalex.org/W2008292658","https://openalex.org/W2009281933","https://openalex.org/W2045107949","https://openalex.org/W2073647817","https://openalex.org/W2084990336","https://openalex.org/W2099463627","https://openalex.org/W2106759055","https://openalex.org/W2107780763","https://openalex.org/W2133352257","https://openalex.org/W2140097884","https://openalex.org/W2150516767","https://openalex.org/W2153441719","https://openalex.org/W2278710066","https://openalex.org/W2624960300","https://openalex.org/W2886596322","https://openalex.org/W2949083732","https://openalex.org/W2962921664","https://openalex.org/W2963388608","https://openalex.org/W2963751092","https://openalex.org/W3034220602","https://openalex.org/W3034936862","https://openalex.org/W3126680358","https://openalex.org/W4230403880","https://openalex.org/W4389615663","https://openalex.org/W4390575860"],"related_works":["https://openalex.org/W2968037521","https://openalex.org/W4301329442","https://openalex.org/W2953390393","https://openalex.org/W2357469710","https://openalex.org/W2461841679","https://openalex.org/W2596165142","https://openalex.org/W69176915","https://openalex.org/W2118779360","https://openalex.org/W196138040","https://openalex.org/W2461366636"],"abstract_inverted_index":{"We":[0],"present":[1],"an":[2,22,30,50,59,63,72,76,81],"algorithm":[3,43,60,73],"which":[4,61,74],"given":[5,75],"any":[6],"$m$-edge":[7,77],"directed":[8],"graph":[9,79],"with":[10],"positive":[11],"integer":[12],"capacities":[13],"at":[14],"most":[15],"$U$,":[16],"vertices":[17],"$a$":[18],"and":[19,21,53,71],"$b$,":[20],"approximation":[23],"parameter":[24],"$\\epsilon":[25,32,45],"\\in":[26],"(0,":[27],"1)$":[28],"computes":[29,62,80],"additive":[31],"mU$-approximate":[33],"$a$-$b$":[34,65],"maximum":[35,66,83],"flow":[36,67],"in":[37,68,86],"time":[38,69,87],"$m^{1+o(1)}/\\sqrt{\\epsilon}$.":[39],"By":[40],"applying":[41],"the":[42],"for":[44],"=":[46],"(mU)^{-2/3}$,":[47],"rounding":[48],"to":[49],"integral":[51],"flow,":[52],"using":[54],"augmenting":[55],"paths,":[56],"we":[57],"obtain":[58],"exact":[64,82],"$m^{4/3+o(1)}U^{1/3}$":[70],"bipartite":[78],"cardinality":[84],"matching":[85],"$m^{4/3+o(1)}$.":[88]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2}],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2025-10-10T00:00:00"}