{"id":"https://openalex.org/W4376639528","doi":"https://doi.org/10.1145/3564246.3585202","title":"Maximum Length-Constrained Flows and Disjoint Paths: Distributed, Deterministic, and Fast","display_name":"Maximum Length-Constrained Flows and Disjoint Paths: Distributed, Deterministic, and Fast","publication_year":2023,"publication_date":"2023-05-16","ids":{"openalex":"https://openalex.org/W4376639528","doi":"https://doi.org/10.1145/3564246.3585202"},"language":"en","primary_location":{"id":"doi:10.1145/3564246.3585202","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3564246.3585202","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 55th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-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/A5080591933","display_name":"Bernhard Haeupler","orcid":"https://orcid.org/0000-0003-3381-0459"},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]},{"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":["CH","US"],"is_corresponding":false,"raw_author_name":"Bernhard Haeupler","raw_affiliation_strings":["ETH Zurich, Switzerland / Carnegie Mellon University, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ETH Zurich, Switzerland / Carnegie Mellon University, USA","institution_ids":["https://openalex.org/I74973139","https://openalex.org/I35440088"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5021573603","display_name":"D Ellis Hershkowitz","orcid":"https://orcid.org/0000-0003-0862-3715"},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"D. Ellis Hershkowitz","raw_affiliation_strings":["ETH Zurich, Switzerland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ETH Zurich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5010547647","display_name":"Thatchaphol Saranurak","orcid":"https://orcid.org/0000-0001-8386-7168"},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Thatchaphol Saranurak","raw_affiliation_strings":["University of Michigan, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Michigan, USA","institution_ids":["https://openalex.org/I27837315"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.3011,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.82777334,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1371","last_page":"1383"},"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9993000030517578,"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"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/maximum-flow-problem","display_name":"Maximum flow problem","score":0.8366266489028931},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.7739566564559937},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6971613168716431},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.560337483882904},{"id":"https://openalex.org/keywords/latency","display_name":"Latency (audio)","score":0.5483437776565552},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.5270911455154419},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.44136661291122437},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4356663227081299},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3577471971511841},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33666640520095825},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.32129278779029846},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.2462863326072693},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21390748023986816},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.16333189606666565}],"concepts":[{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.8366266489028931},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.7739566564559937},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6971613168716431},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.560337483882904},{"id":"https://openalex.org/C82876162","wikidata":"https://www.wikidata.org/wiki/Q17096504","display_name":"Latency (audio)","level":2,"score":0.5483437776565552},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.5270911455154419},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.44136661291122437},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4356663227081299},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3577471971511841},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33666640520095825},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.32129278779029846},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.2462863326072693},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21390748023986816},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.16333189606666565},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3564246.3585202","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3564246.3585202","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 55th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1523888516","display_name":null,"funder_award_id":"FA9550-","funder_id":"https://openalex.org/F4320338279","funder_display_name":"Air Force Office of Scientific Research"},{"id":"https://openalex.org/G1727066179","display_name":null,"funder_award_id":"949272","funder_id":"https://openalex.org/F4320334678","funder_display_name":"European Research Council"},{"id":"https://openalex.org/G2213600020","display_name":null,"funder_award_id":"2238138","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G2962458518","display_name":null,"funder_award_id":"CCF-1910588","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3280610492","display_name":"CIF: Small: New Coding Techniques for Synchronization Errors","funder_award_id":"1814603","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G36446433","display_name":null,"funder_award_id":"FA9550-20-1","funder_id":"https://openalex.org/F4320338279","funder_display_name":"Air Force Office of Scientific Research"},{"id":"https://openalex.org/G4189525098","display_name":"Distributed Optimization Beyond Worst-Case Topologies","funder_award_id":"949272","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G5019367631","display_name":null,"funder_award_id":"FA9550-20-1-0080","funder_id":"https://openalex.org/F4320338279","funder_display_name":"Air Force Office of Scientific Research"},{"id":"https://openalex.org/G5454242832","display_name":"CCF-BSF: AF: Small: Coding for Distributed Computing","funder_award_id":"1618280","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5729145195","display_name":null,"funder_award_id":"FA9550-20","funder_id":"https://openalex.org/F4320338279","funder_display_name":"Air Force Office of Scientific Research"},{"id":"https://openalex.org/G5809100787","display_name":null,"funder_award_id":"FA9550","funder_id":"https://openalex.org/F4320338279","funder_display_name":"Air Force Office of Scientific Research"},{"id":"https://openalex.org/G6671297155","display_name":null,"funder_award_id":"CAREER","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6751408502","display_name":null,"funder_award_id":"CCF-1814603","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7442669385","display_name":null,"funder_award_id":"CCF-1527110","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7659139977","display_name":null,"funder_award_id":"CCF-1618280","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G845880798","display_name":null,"funder_award_id":"CCF-1527110, CCF-1618280, CCF-1814603, CCF-1910588, CCF1750808, CCF 2238138","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8950406855","display_name":null,"funder_award_id":"CCF-1527110, CCF-1618280","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8991894024","display_name":"AF: Small: Distributed Algorithms for Near-Planar Networks","funder_award_id":"1527110","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G99399730","display_name":"AF: Small: Distributed Optimization Beyond Worst Case Topologies","funder_award_id":"1910588","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/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320334678","display_name":"European Research Council","ror":"https://ror.org/0472cxd90"},{"id":"https://openalex.org/F4320338279","display_name":"Air Force Office of Scientific Research","ror":"https://ror.org/011e9bt93"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W1947006564","https://openalex.org/W1974115975","https://openalex.org/W2010130610","https://openalex.org/W2019404063","https://openalex.org/W2025838844","https://openalex.org/W2030863680","https://openalex.org/W2032312374","https://openalex.org/W2034269606","https://openalex.org/W2041528256","https://openalex.org/W2045107949","https://openalex.org/W2079780027","https://openalex.org/W2083323175","https://openalex.org/W2095727035","https://openalex.org/W2116055396","https://openalex.org/W2122205547","https://openalex.org/W2140097884","https://openalex.org/W2143629726","https://openalex.org/W2242403914","https://openalex.org/W2748046883","https://openalex.org/W2903365982","https://openalex.org/W2908664940","https://openalex.org/W2963972775","https://openalex.org/W2964264613","https://openalex.org/W2966444153","https://openalex.org/W3034903651","https://openalex.org/W3046783344","https://openalex.org/W3127312219","https://openalex.org/W3127810600","https://openalex.org/W3128057791","https://openalex.org/W3168169702","https://openalex.org/W3170201847","https://openalex.org/W4205300528","https://openalex.org/W4210896998","https://openalex.org/W4281710856","https://openalex.org/W6631644673"],"related_works":["https://openalex.org/W2375873432","https://openalex.org/W4206915070","https://openalex.org/W2531764854","https://openalex.org/W2098682899","https://openalex.org/W3161514703","https://openalex.org/W2141299097","https://openalex.org/W1851375266","https://openalex.org/W2610002854","https://openalex.org/W3141113327","https://openalex.org/W4206407367"],"abstract_inverted_index":{"Computing":[0],"routing":[1],"schemes":[2],"that":[3],"support":[4],"both":[5],"high":[6],"throughput":[7],"and":[8,47],"low":[9],"latency":[10],"is":[11,62],"one":[12],"of":[13,17,54],"the":[14,58],"core":[15],"challenges":[16],"network":[18,67,77],"optimization.":[19],"Such":[20],"routes":[21],"can":[22,78],"be":[23],"formalized":[24],"as":[25,31,45],"h-length":[26,55,60],"flows":[27,32],"which":[28],"are":[29],"defined":[30],"whose":[33],"flow":[34,61],"paths":[35],"have":[36],"length":[37],"at":[38],"most":[39],"h.":[40],"Many":[41],"well-studied":[42],"algorithmic":[43],"primitives\u2014such":[44],"maximal":[46],"maximum":[48],"length-constrained":[49],"disjoint":[50],"paths\u2014are":[51],"special":[52],"cases":[53],"flows.":[56],"Likewise":[57],"optimal":[59],"a":[63,76],"fundamental":[64],"quantity":[65],"in":[66],"optimization,":[68],"characterizing,":[69],"up":[70],"to":[71],"poly-log":[72],"factors,":[73],"how":[74],"quickly":[75],"accomplish":[79],"numerous":[80],"distributed":[81],"primitives.":[82]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":4}],"updated_date":"2026-06-14T07:44:22.658603","created_date":"2025-10-10T00:00:00"}