{"id":"https://openalex.org/W4380880524","doi":"https://doi.org/10.1145/3583668.3594566","title":"Brief Announcement: Minimum Cost Maximum Flow in the CONGEST Model","display_name":"Brief Announcement: Minimum Cost Maximum Flow in the CONGEST Model","publication_year":2023,"publication_date":"2023-06-16","ids":{"openalex":"https://openalex.org/W4380880524","doi":"https://doi.org/10.1145/3583668.3594566"},"language":"en","primary_location":{"id":"doi:10.1145/3583668.3594566","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3583668.3594566","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3583668.3594566","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 2023 ACM Symposium on Principles of Distributed 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/3583668.3594566","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5079386151","display_name":"Tijn de Vos","orcid":"https://orcid.org/0000-0002-1417-6387"},"institutions":[{"id":"https://openalex.org/I182212641","display_name":"University of Salzburg","ror":"https://ror.org/05gs8cd61","country_code":"AT","type":"education","lineage":["https://openalex.org/I182212641"]}],"countries":["AT"],"is_corresponding":true,"raw_author_name":"Tijn de Vos","raw_affiliation_strings":["University of Salzburg, Salzburg, Austria"],"raw_orcid":"https://orcid.org/0000-0002-1417-6387","affiliations":[{"raw_affiliation_string":"University of Salzburg, Salzburg, Austria","institution_ids":["https://openalex.org/I182212641"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5079386151"],"corresponding_institution_ids":["https://openalex.org/I182212641"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.12443574,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"71","last_page":"74"},"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.9998000264167786,"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.9998000264167786,"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/T12288","display_name":"Optimization and Search Problems","score":0.996399998664856,"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/computer-science","display_name":"Computer science","score":0.6588636636734009},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.5340783596038818},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.48815208673477173},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.4796914756298065},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.47084423899650574},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.43994849920272827},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.41424405574798584},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3163781762123108},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.25451385974884033},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.24548399448394775},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.20055842399597168},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.18695083260536194},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.10303831100463867}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6588636636734009},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.5340783596038818},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.48815208673477173},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.4796914756298065},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.47084423899650574},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.43994849920272827},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.41424405574798584},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3163781762123108},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.25451385974884033},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.24548399448394775},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.20055842399597168},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.18695083260536194},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.10303831100463867},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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/3583668.3594566","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3583668.3594566","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3583668.3594566","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 2023 ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3583668.3594566","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3583668.3594566","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3583668.3594566","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 2023 ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1317235720","display_name":"Dynamic Algorithms Against Strong Adversaries","funder_award_id":"947702","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G1580716774","display_name":null,"funder_award_id":"947702","funder_id":"https://openalex.org/F4320334678","funder_display_name":"European Research Council"},{"id":"https://openalex.org/G5833454457","display_name":null,"funder_award_id":"P 32863-N","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"},{"id":"https://openalex.org/G7842005466","display_name":null,"funder_award_id":"Horizon 2020","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G8151294431","display_name":"Distributed Algorithms for Fundamental Graph Problems","funder_award_id":"P 32863","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"}],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320321181","display_name":"Austrian Science Fund","ror":"https://ror.org/013tf3c58"},{"id":"https://openalex.org/F4320334678","display_name":"European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4380880524.pdf"},"referenced_works_count":23,"referenced_works":["https://openalex.org/W1861736669","https://openalex.org/W1979505770","https://openalex.org/W1984090926","https://openalex.org/W2015819397","https://openalex.org/W2083323175","https://openalex.org/W2084990336","https://openalex.org/W2099143789","https://openalex.org/W2102560346","https://openalex.org/W2133352257","https://openalex.org/W2208409594","https://openalex.org/W2568484534","https://openalex.org/W2949824190","https://openalex.org/W2963324223","https://openalex.org/W2963751092","https://openalex.org/W3034415339","https://openalex.org/W3034903651","https://openalex.org/W3126680358","https://openalex.org/W3129191225","https://openalex.org/W3159770304","https://openalex.org/W3216836550","https://openalex.org/W4205300528","https://openalex.org/W4286209950","https://openalex.org/W6600007113"],"related_works":["https://openalex.org/W1480846237","https://openalex.org/W2964174631","https://openalex.org/W1810116456","https://openalex.org/W4300619607","https://openalex.org/W239742334","https://openalex.org/W3037533092","https://openalex.org/W2088441646","https://openalex.org/W1605572092","https://openalex.org/W1548014395","https://openalex.org/W1726008105"],"abstract_inverted_index":{"We":[0,98],"consider":[1],"the":[2,36,47,50,63,110,120,135],"CONGEST":[3,111,117],"model":[4,112],"on":[5,106],"a":[6,116],"network":[7],"with":[8,53,115],"n":[9],"nodes,":[10],"m":[11],"edges,":[12],"diameter":[13],"D,":[14],"and":[15,18,89,125,128],"integer":[16],"costs":[17],"capacities":[19],"bounded":[20],"by":[21,102],"poly":[22],"n.":[23],"In":[24,78],"this":[25,100],"paper,":[26],"we":[27,73,132],"show":[28,130],"how":[29],"to":[30,35,138,154],"find":[31],"an":[32,139],"exact":[33,140],"solution":[34,137],"minimum":[37,150],"cost":[38,151],"flow":[39],"problem":[40],"in":[41,109,158],"n1/2+o(1)(\u221an":[42,159],"+":[43,57,160],"D)":[44],"rounds,":[45],"improving":[46],"state":[48],"of":[49,66,119,123],"art":[51],"algorithm":[52,93,143],"running":[54],"time":[55],"m3/7+o(1)(\u221anD1/4":[56],"D)[13],":[58],"which":[59],"only":[60],"holds":[61],"for":[62,80],"special":[64],"case":[65],"unit":[67],"capacity":[68],"graphs.":[69],"For":[70],"certain":[71,145],"graphs,":[72,82,84,86,88],"achieve":[74],"even":[75],"better":[76],"results.":[77],"particular,":[79],"planar":[81],"expander":[83],"no(1)-genus":[85],"no(1)-treewidth":[87],"excluded-minor":[90],"graphs":[91],"our":[92],"takes":[94],"n1/2+o(1)":[95],"D":[96],"rounds.":[97,162],"obtain":[99],"result":[101],"combining":[103],"recent":[104],"results":[105],"Laplacian":[107],"solvers":[108],"[2,":[113],"13]":[114],"implementation":[118],"LP":[121],"solver":[122],"Lee":[124],"Sidford":[126],"[22],":[127],"finally":[129],"that":[131,148],"can":[133],"round":[134],"approximate":[136],"solution.":[141],"Our":[142],"solves":[144],"linear":[146],"programs,":[147],"generalize":[149],"flow,":[152],"up":[153],"additive":[155],"error":[156],"\u03f5":[157],"D)log3(1/\u03f5)":[161]},"counts_by_year":[],"updated_date":"2026-04-27T08:22:11.395708","created_date":"2025-10-10T00:00:00"}