{"id":"https://openalex.org/W2009190935","doi":"https://doi.org/10.1145/1007352.1007432","title":"(Almost) tight bounds and existence theorems for confluent flows","display_name":"(Almost) tight bounds and existence theorems for confluent flows","publication_year":2004,"publication_date":"2004-06-13","ids":{"openalex":"https://openalex.org/W2009190935","doi":"https://doi.org/10.1145/1007352.1007432","mag":"2009190935"},"language":"en","primary_location":{"id":"doi:10.1145/1007352.1007432","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1007352.1007432","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the thirty-sixth annual ACM symposium on Theory of computing","raw_type":"proceedings-article"},"type":"conference-paper","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/A5065844089","display_name":"Jiangzhuo Chen","orcid":"https://orcid.org/0000-0002-2729-3881"},"institutions":[{"id":"https://openalex.org/I12912129","display_name":"Northeastern University","ror":"https://ror.org/04t5xt781","country_code":"US","type":"education","lineage":["https://openalex.org/I12912129"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jiangzhuo Chen","raw_affiliation_strings":["Northeastern University, Boston, MA","Northeastern University, Boston (MA)#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Northeastern University, Boston, MA","institution_ids":["https://openalex.org/I12912129"]},{"raw_affiliation_string":"Northeastern University, Boston (MA)#TAB#","institution_ids":["https://openalex.org/I12912129"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5040052580","display_name":"Robert Kleinberg","orcid":"https://orcid.org/0000-0002-8306-3407"},"institutions":[{"id":"https://openalex.org/I4210110987","display_name":"IIT@MIT","ror":"https://ror.org/01wp8zh54","country_code":"US","type":"facility","lineage":["https://openalex.org/I30771326","https://openalex.org/I4210110987"]},{"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":false,"raw_author_name":"Robert D. Kleinberg","raw_affiliation_strings":["MIT, Cambridge, MA","MIT, Cambridge, Ma.#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"MIT, Cambridge, MA","institution_ids":["https://openalex.org/I4210110987"]},{"raw_affiliation_string":"MIT, Cambridge, Ma.#TAB#","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5067889485","display_name":"L\u00e1szl\u00f3 Lov\u00e1sz","orcid":"https://orcid.org/0000-0002-6242-5894"},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"L\u00e1szl\u00f3 Lov\u00e1sz","raw_affiliation_strings":["Microsoft Research, Redmond, WA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research, Redmond, WA","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103525476","display_name":"Rajmohan Rajaraman","orcid":null},"institutions":[{"id":"https://openalex.org/I12912129","display_name":"Northeastern University","ror":"https://ror.org/04t5xt781","country_code":"US","type":"education","lineage":["https://openalex.org/I12912129"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Rajmohan Rajaraman","raw_affiliation_strings":["Northeastern University, Boston, MA","Northeastern University, Boston (MA)#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Northeastern University, Boston, MA","institution_ids":["https://openalex.org/I12912129"]},{"raw_affiliation_string":"Northeastern University, Boston (MA)#TAB#","institution_ids":["https://openalex.org/I12912129"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103159653","display_name":"Ravi Sundaram","orcid":"https://orcid.org/0000-0001-5657-4298"},"institutions":[{"id":"https://openalex.org/I12912129","display_name":"Northeastern University","ror":"https://ror.org/04t5xt781","country_code":"US","type":"education","lineage":["https://openalex.org/I12912129"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ravi Sundaram","raw_affiliation_strings":["Northeastern University, Boston, MA","Northeastern University, Boston (MA)#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Northeastern University, Boston, MA","institution_ids":["https://openalex.org/I12912129"]},{"raw_affiliation_string":"Northeastern University, Boston (MA)#TAB#","institution_ids":["https://openalex.org/I12912129"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5027727214","display_name":"Adrian Vetta","orcid":"https://orcid.org/0000-0002-2213-4937"},"institutions":[{"id":"https://openalex.org/I5023651","display_name":"McGill University","ror":"https://ror.org/01pxwe438","country_code":"CA","type":"education","lineage":["https://openalex.org/I5023651"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Adrian Vetta","raw_affiliation_strings":["McGill University, Montreal, Quebec, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"McGill University, Montreal, Quebec, Canada","institution_ids":["https://openalex.org/I5023651"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.1247,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.75425627,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"529","last_page":"538"},"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.9987999796867371,"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.9983000159263611,"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/mathematics","display_name":"Mathematics","score":0.562945544719696},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5580304265022278},{"id":"https://openalex.org/keywords/multiplicative-function","display_name":"Multiplicative function","score":0.5228458046913147},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4810512363910675},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4732537865638733},{"id":"https://openalex.org/keywords/sink","display_name":"Sink (geography)","score":0.4557277262210846},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.443250447511673},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.44198253750801086},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.43772467970848083},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.4374709725379944},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.4362643361091614},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.4230010509490967},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4078761637210846},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3003249764442444},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.22401735186576843},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.07539603114128113}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.562945544719696},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5580304265022278},{"id":"https://openalex.org/C42747912","wikidata":"https://www.wikidata.org/wiki/Q1048447","display_name":"Multiplicative function","level":2,"score":0.5228458046913147},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4810512363910675},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4732537865638733},{"id":"https://openalex.org/C143050476","wikidata":"https://www.wikidata.org/wiki/Q194502","display_name":"Sink (geography)","level":2,"score":0.4557277262210846},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.443250447511673},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.44198253750801086},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.43772467970848083},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.4374709725379944},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.4362643361091614},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.4230010509490967},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4078761637210846},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3003249764442444},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.22401735186576843},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.07539603114128113},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C58640448","wikidata":"https://www.wikidata.org/wiki/Q42515","display_name":"Cartography","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1007352.1007432","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1007352.1007432","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the thirty-sixth annual ACM symposium on Theory of computing","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.73.5679","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.73.5679","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ccs.neu.edu/home/rraj/Pubs/confluence.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/6","display_name":"Clean water and sanitation","score":0.75}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1589657219","https://openalex.org/W1964119857","https://openalex.org/W2000869424","https://openalex.org/W2002531683","https://openalex.org/W2013469283","https://openalex.org/W2034269606","https://openalex.org/W2070767236","https://openalex.org/W2083409154","https://openalex.org/W2094410510","https://openalex.org/W2100699015","https://openalex.org/W2102201348","https://openalex.org/W2109640907","https://openalex.org/W2111308047","https://openalex.org/W2113834527","https://openalex.org/W2143996311","https://openalex.org/W2569646339","https://openalex.org/W2599142459","https://openalex.org/W2798766386","https://openalex.org/W3014052784","https://openalex.org/W3040586665","https://openalex.org/W4213060883","https://openalex.org/W4255970238","https://openalex.org/W6781618339"],"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":{"A":[0],"flow":[1,13,44,117,132,155,164,200,236,253],"is":[2,61,88,109,190,278,310,320,335],"said":[3],"to":[4,50,177,192,201,213],"be":[5],"confluent":[6,43,84,101,116,163,199,252,273,299],"if":[7,127,231,281],"at":[8,58,120,135,158,239,258],"any":[9,325],"node":[10,48,326],"all":[11,31],"the":[12,32,38,55,81,194,210,226,246,270,282,311,314,321],"leaves":[14],"along":[15],"a":[16,20,42,59,67,110,115,130,148,153,203,215,221,234,243,251],"single":[17],"edge.":[18],"Given":[19],"directed":[21],"graph":[22,149,284],"G":[23,128,150,232,255],"with":[24,118,133,156,165,256,295],"k":[25,286,296],"sinks":[26,297],"and":[27,97,174,275,318,337],"non-negative":[28],"demands":[29],"on":[30,339],"nodes":[33],"of":[34,40,69,106,196,205,225,237,245,265,301,313,324,331],"G,":[35,126],"we":[36,146,186,290],"consider":[37,220],"problem":[39],"determining":[41,114],"that":[45,54,151,188,230,261,269,292],"routes":[46],"every":[47],"demand":[49,222,323],"some":[51],"sink":[52,60],"such":[53],"maximum":[56,322],"congestion":[57,119,134,157,166,195,238,247,257,302,312],"minimized.":[62],"Confluent":[63],"flows":[64,79,274,277,300],"arise":[65],"in":[66,74,76,80,125,142,254,327,343],"variety":[68],"application":[70],"areas,":[71],"most":[72,78,121,136,159,240,259],"notably":[73],"networking;":[75],"fact,":[77],"Internet":[82,86],"are":[83],"since":[85],"routing":[87],"destination":[89],"based.We":[90],"present":[91,147],"near-tight":[92],"approximation":[93],"algorithms,":[94],"hardness":[95],"results,":[96],"existence":[98,333],"theorems":[99],"for":[100,113],"flows.":[102],"The":[103,329],"main":[104],"result":[105,141],"this":[107,140,332],"paper":[108],"polynomial-time":[111,211],"algorithm":[112,249],"1":[122,260],"+":[123,306],"ln(k)":[124],"admits":[129,152,233],"splittable":[131,154,235,276,316],"1.":[137,184],"We":[138,218,228],"complement":[139],"two":[143],"directions.":[144],"First,":[145],"1,":[160,241],"yet":[161],"no":[162],"smaller":[167],"than":[168,183,304],"Hk,":[169],"thus":[170,208],"establishing":[171],"tight":[172],"upper":[173],"lower":[175],"bounds":[176],"within":[178,202,214],"an":[179,197],"additive":[180],"constant":[181],"less":[182,303],"Second,":[185],"show":[187,229,268],"it":[189],"NP-hard":[191],"approximate":[193],"optimal":[198],"factor":[204],"(lg":[206],"k)/2,":[207],"resolving":[209],"approximability":[212],"multiplicative":[216],"constant.":[217],"also":[219],"maximization":[223],"version":[224],"problem.":[227],"then":[242],"variant":[244],"minimization":[248],"yields":[250],"satisfies":[262],"1/3":[263],"fraction":[264],"total":[266],"demand.We":[267],"gap":[271],"between":[272],"much":[279],"smaller,":[280],"underlying":[283],"were":[285],"connected.":[287],"In":[288],"particular,":[289],"prove":[291],"k-connected":[293],"graphs":[294],"admit":[298],"C":[305,309],"dmax,":[307],"where":[308],"best":[315],"flow,":[317],"dmax":[319],"G.":[328],"proof":[330],"theorem":[334],"non-constructive":[336],"relies":[338],"topological":[340],"techniques":[341],"introduced":[342],"[16].":[344]},"counts_by_year":[{"year":2015,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}