{"id":"https://openalex.org/W1861736669","doi":"https://doi.org/10.1137/17m113277x","title":"Near-Optimal Distributed Maximum Flow","display_name":"Near-Optimal Distributed Maximum Flow","publication_year":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W1861736669","doi":"https://doi.org/10.1137/17m113277x","mag":"1861736669"},"language":"en","primary_location":{"id":"doi:10.1137/17m113277x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/17m113277x","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/A5088284921","display_name":"Mohsen Ghaffari","orcid":"https://orcid.org/0000-0002-1939-9053"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Mohsen Ghaffari","raw_affiliation_strings":["Massachusetts Institute of Technology"],"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5015328592","display_name":"Andreas Karrenbauer","orcid":"https://orcid.org/0000-0001-6129-3220"},"institutions":[{"id":"https://openalex.org/I149899117","display_name":"Max Planck Society","ror":"https://ror.org/01hhn8329","country_code":"DE","type":"funder","lineage":["https://openalex.org/I149899117"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Andreas Karrenbauer","raw_affiliation_strings":["Algorithms and Complexity, MPI for Informatics, Max Planck Society"],"affiliations":[{"raw_affiliation_string":"Algorithms and Complexity, MPI for Informatics, Max Planck Society","institution_ids":["https://openalex.org/I149899117"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5023808567","display_name":"Fabian K\u00fchn","orcid":"https://orcid.org/0000-0002-1025-5037"},"institutions":[{"id":"https://openalex.org/I161046081","display_name":"University of Freiburg","ror":"https://ror.org/0245cg223","country_code":"DE","type":"education","lineage":["https://openalex.org/I161046081"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Fabian Kuhn","raw_affiliation_strings":["Albert-Ludwigs-University of Freiburg"],"affiliations":[{"raw_affiliation_string":"Albert-Ludwigs-University of Freiburg","institution_ids":["https://openalex.org/I161046081"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5006005471","display_name":"Christoph Lenzen","orcid":"https://orcid.org/0000-0002-3290-0674"},"institutions":[{"id":"https://openalex.org/I149899117","display_name":"Max Planck Society","ror":"https://ror.org/01hhn8329","country_code":"DE","type":"funder","lineage":["https://openalex.org/I149899117"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Christoph Lenzen","raw_affiliation_strings":["Algorithms and Complexity, MPI for Informatics, Max Planck Society"],"affiliations":[{"raw_affiliation_string":"Algorithms and Complexity, MPI for Informatics, Max Planck Society","institution_ids":["https://openalex.org/I149899117"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5016261142","display_name":"Boaz Patt-Shamir","orcid":"https://orcid.org/0000-0001-8398-8218"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Boaz Patt-Shamir","raw_affiliation_strings":["Tel-Aviv  University"],"affiliations":[{"raw_affiliation_string":"Tel-Aviv  University","institution_ids":["https://openalex.org/I16391192"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5088284921"],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":null,"apc_paid":null,"fwci":1.6155,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.84671388,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"47","issue":"6","first_page":"2078","last_page":"2117"},"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9991999864578247,"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"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9973999857902527,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.7095652222633362},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5996330380439758},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5723483562469482},{"id":"https://openalex.org/keywords/omega","display_name":"Omega","score":0.5672496557235718},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.5320329070091248},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.5318610072135925},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4567282795906067},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4472709596157074},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.34902793169021606},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.16852939128875732},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.16316330432891846},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.08076894283294678}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7095652222633362},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5996330380439758},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5723483562469482},{"id":"https://openalex.org/C2779557605","wikidata":"https://www.wikidata.org/wiki/Q9890","display_name":"Omega","level":2,"score":0.5672496557235718},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.5320329070091248},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.5318610072135925},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4567282795906067},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4472709596157074},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.34902793169021606},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.16852939128875732},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.16316330432891846},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.08076894283294678},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/17m113277x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/17m113277x","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":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W1543491698","https://openalex.org/W1568961751","https://openalex.org/W1967939903","https://openalex.org/W1969080501","https://openalex.org/W1981859328","https://openalex.org/W1991838331","https://openalex.org/W2005900781","https://openalex.org/W2017322423","https://openalex.org/W2028155031","https://openalex.org/W2030825457","https://openalex.org/W2066308383","https://openalex.org/W2071864516","https://openalex.org/W2099463627","https://openalex.org/W2100001654","https://openalex.org/W2106759055","https://openalex.org/W2124541940","https://openalex.org/W2134422938","https://openalex.org/W2141824346","https://openalex.org/W2147133278","https://openalex.org/W2149272173","https://openalex.org/W2150865801","https://openalex.org/W2163656645","https://openalex.org/W2167732364","https://openalex.org/W2169528477","https://openalex.org/W2170720733","https://openalex.org/W2257156746","https://openalex.org/W2338905098","https://openalex.org/W2950755820","https://openalex.org/W4231761369"],"related_works":["https://openalex.org/W238609530","https://openalex.org/W2734192830","https://openalex.org/W3127082728","https://openalex.org/W1983915440","https://openalex.org/W2067936666","https://openalex.org/W3095925971","https://openalex.org/W1562183146","https://openalex.org/W2137594557","https://openalex.org/W2899261484","https://openalex.org/W2902010279"],"abstract_inverted_index":{"We":[0],"present":[1],"a":[2,79],"near-optimal":[3],"distributed":[4,76,90,107],"algorithm":[5,65],"for":[6,114],"$(1+o(1))$-approximation":[7],"of":[8,34,50,63,69,78,82,92,97,109,125],"single-commodity":[9],"maximum":[10],"flow":[11],"in":[12,18,23,116],"undirected":[13],"weighted":[14],"networks":[15],"that":[16],"runs":[17],"$(D+\\sqrt{n})\\cdot":[19,74,88,117],"n^{o(1)}$":[20,118],"communication":[21],"rounds":[22],"the":[24,32,37,43,47,56,64,98,110],"CONGEST":[25],"model.":[26],"Here,":[27],"$n$":[28],"and":[29,36,52,127],"$D$":[30],"denote":[31],"number":[33],"nodes":[35],"network":[38],"diameter,":[39],"respectively.":[40],"This":[41],"is":[42],"first":[44],"improvement":[45],"over":[46],"trivial":[48],"bound":[49],"$O(n^2)$,":[51],"it":[53],"nearly":[54],"matches":[55],"$\\tilde{\\Omega}(D+\\sqrt{n})$-round":[57],"complexity":[58],"lower":[59],"bound.":[60],"The":[61,106],"development":[62],"entails":[66],"two":[67],"subresults":[68],"independent":[70],"interest:":[71],"(i)":[72],"A":[73,87],"n^{o(1)}$-round":[75,89],"construction":[77,91],"spanning":[80],"tree":[81],"average":[83],"stretch":[84],"$n^{o(1)}$.":[85],"(ii)":[86],"an":[93],"$n^{o(1)}$-congestion":[94],"approximator":[95,112],"consisting":[96],"cuts":[99],"induced":[100],"by":[101],"$O(\\log":[102],"n)$":[103],"virtual":[104],"trees.":[105],"representation":[108],"cut":[111],"allows":[113],"evaluation":[115],"rounds.":[119],"All":[120],"our":[121],"algorithms":[122],"make":[123],"use":[124],"randomization":[126],"succeed":[128],"with":[129],"high":[130],"probability.":[131]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":4},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}