{"id":"https://openalex.org/W2119862441","doi":"https://doi.org/10.1145/1007352.1007383","title":"The all-or-nothing multicommodity flow problem","display_name":"The all-or-nothing multicommodity flow problem","publication_year":2004,"publication_date":"2004-06-13","ids":{"openalex":"https://openalex.org/W2119862441","doi":"https://doi.org/10.1145/1007352.1007383","mag":"2119862441"},"language":"en","primary_location":{"id":"doi:10.1145/1007352.1007383","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1007352.1007383","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":"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/A5036503505","display_name":"Chandra Chekuri","orcid":"https://orcid.org/0000-0003-3035-1699"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Chandra Chekuri","raw_affiliation_strings":["Lucent Bell Labs, Murray Hill, NJ"],"affiliations":[{"raw_affiliation_string":"Lucent Bell Labs, Murray Hill, NJ","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5039619350","display_name":"Sanjeev Khanna","orcid":"https://orcid.org/0009-0000-2601-1689"},"institutions":[{"id":"https://openalex.org/I79576946","display_name":"University of Pennsylvania","ror":"https://ror.org/00b30xv10","country_code":"US","type":"education","lineage":["https://openalex.org/I79576946"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sanjeev Khanna","raw_affiliation_strings":["University of Pennsylvania, Philadelphia, PA"],"affiliations":[{"raw_affiliation_string":"University of Pennsylvania, Philadelphia, PA","institution_ids":["https://openalex.org/I79576946"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5044801840","display_name":"F. Bruce Shepherd","orcid":"https://orcid.org/0000-0003-1972-1396"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"F. Bruce Shepherd","raw_affiliation_strings":["Lucent Bell Labs, Murray Hill, NJ"],"affiliations":[{"raw_affiliation_string":"Lucent Bell Labs, Murray Hill, NJ","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5036503505"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":9.3341,"has_fulltext":false,"cited_by_count":85,"citation_normalized_percentile":{"value":0.98448276,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"156","last_page":"165"},"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.9994999766349792,"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.9994999766349792,"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.998199999332428,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9973999857902527,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/multi-commodity-flow-problem","display_name":"Multi-commodity flow problem","score":0.7625062465667725},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.6522071957588196},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6343772411346436},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6338782906532288},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6130456328392029},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.5957075357437134},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.5951244831085205},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.5209768414497375},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4946539103984833},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.4667853116989136},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.43839892745018005},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4041707217693329},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.39360785484313965},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.22182708978652954}],"concepts":[{"id":"https://openalex.org/C170334043","wikidata":"https://www.wikidata.org/wiki/Q6934437","display_name":"Multi-commodity flow problem","level":3,"score":0.7625062465667725},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.6522071957588196},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6343772411346436},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6338782906532288},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6130456328392029},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.5957075357437134},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.5951244831085205},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.5209768414497375},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4946539103984833},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.4667853116989136},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.43839892745018005},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4041707217693329},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.39360785484313965},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.22182708978652954},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","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},{"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/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1007352.1007383","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1007352.1007383","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":44,"referenced_works":["https://openalex.org/W1559202792","https://openalex.org/W1563039933","https://openalex.org/W1567467079","https://openalex.org/W1569752386","https://openalex.org/W1589172288","https://openalex.org/W1591562949","https://openalex.org/W1593787329","https://openalex.org/W1921591048","https://openalex.org/W1949395038","https://openalex.org/W1963964297","https://openalex.org/W1971443646","https://openalex.org/W1994495069","https://openalex.org/W1996073274","https://openalex.org/W1999867351","https://openalex.org/W2001532889","https://openalex.org/W2003160050","https://openalex.org/W2004322147","https://openalex.org/W2011764853","https://openalex.org/W2019062750","https://openalex.org/W2020066367","https://openalex.org/W2022191808","https://openalex.org/W2025470209","https://openalex.org/W2034269606","https://openalex.org/W2042276676","https://openalex.org/W2079300367","https://openalex.org/W2080283527","https://openalex.org/W2084706168","https://openalex.org/W2088961276","https://openalex.org/W2096909875","https://openalex.org/W2100699015","https://openalex.org/W2104685111","https://openalex.org/W2107881198","https://openalex.org/W2135424293","https://openalex.org/W2136558412","https://openalex.org/W2139739478","https://openalex.org/W2141793995","https://openalex.org/W2145818650","https://openalex.org/W2150148016","https://openalex.org/W2154571828","https://openalex.org/W2156867662","https://openalex.org/W2160167461","https://openalex.org/W2171868840","https://openalex.org/W2176446742","https://openalex.org/W3014052784"],"related_works":["https://openalex.org/W4231500168","https://openalex.org/W90079504","https://openalex.org/W2032436423","https://openalex.org/W3141113327","https://openalex.org/W3035974271","https://openalex.org/W1561045713","https://openalex.org/W2374451529","https://openalex.org/W2069541586","https://openalex.org/W1553098308","https://openalex.org/W2080904092"],"abstract_inverted_index":{"We":[0,10],"consider":[1],"the":[2,68,83,101,108,136],"all-or-nothing":[3,137,149],"multicommodity":[4],"flow":[5,55,150],"problem":[6,71,86,138,151],"in":[7,49,73,127,139],"general":[8,140],"graphs.":[9,142],"are":[11],"given":[12],"a":[13,30,38,54,96,105,117,132],"capacitated":[14],"undirected":[15,128,141],"graph":[16],"G=(V,E,u)":[17],"and":[18,61,89,104],"set":[19],"of":[20,42,56,120],"k":[21],"pairs":[22],"s1t1,":[23],"s2t2,":[24],"\u2026,":[25],"sktk.":[26],"Each":[27],"pair":[28],"has":[29],"unit":[31,58],"demand.":[32],"The":[33,143],"objective":[34],"is":[35,87,98],"to":[36,130],"find":[37],"largest":[39],"subset":[40],"S":[41,50],"1,2,\u2026,k":[43],"such":[44],"that":[45,64,74],"for":[46,82,100,107,135,148],"every":[47],"i":[48],"we":[51,75,114],"can":[52],"send":[53],"one":[57],"between":[59],"si":[60],"ti.":[62],"Note":[63],"this":[65,112],"differs":[66],"from":[67],"edge-disjoint":[69],"path":[70],"(EDP)":[72],"do":[76],"not":[77],"insist":[78],"on":[79,92,116,122],"integral":[80],"flows":[81],"pairs.":[84],"This":[85],"NP-hard,":[88],"APX-hard,":[90],"even":[91],"trees.":[93],"For":[94],"trees,":[95],"2--approximation":[97],"known":[99,146],"cardinality":[102],"case":[103],"4--approximation":[106],"weighted":[109],"case.":[110],"In":[111],"paper":[113],"build":[115],"recent":[118],"result":[119],"Racke":[121],"low":[123],"congestion":[124],"oblivious":[125],"routing":[126],"graphs":[129],"obtain":[131],"poly-logarithmic":[133],"approximation":[134,147],"best":[144],"previous":[145],"was":[152],"O(min(n":[153]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":6}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}