{"id":"https://openalex.org/W2170344325","doi":"https://doi.org/10.1145/1273340.1273343","title":"Multicommodity demand flow in a tree and packing integer programs","display_name":"Multicommodity demand flow in a tree and packing integer programs","publication_year":2007,"publication_date":"2007-08-01","ids":{"openalex":"https://openalex.org/W2170344325","doi":"https://doi.org/10.1145/1273340.1273343","mag":"2170344325"},"language":"en","primary_location":{"id":"doi:10.1145/1273340.1273343","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1273340.1273343","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","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/A5036503505","display_name":"Chandra Chekuri","orcid":"https://orcid.org/0000-0003-3035-1699"},"institutions":[{"id":"https://openalex.org/I2801919071","display_name":"University of Illinois System","ror":"https://ror.org/05e94g991","country_code":"US","type":"education","lineage":["https://openalex.org/I2801919071"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Chandra Chekuri","raw_affiliation_strings":["University of Illinois, Urbana, IL"],"affiliations":[{"raw_affiliation_string":"University of Illinois, Urbana, IL","institution_ids":["https://openalex.org/I2801919071"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5022061076","display_name":"Marcelo Mydlarz","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Marcelo Mydlarz","raw_affiliation_strings":["Yahoo! Research, Santiago, Chile"],"affiliations":[{"raw_affiliation_string":"Yahoo! Research, Santiago, Chile","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5044801840","display_name":"F. Bruce Shepherd","orcid":"https://orcid.org/0000-0003-1972-1396"},"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":"F. Bruce Shepherd","raw_affiliation_strings":["McGill University, Montreal, Quebec, Canada"],"affiliations":[{"raw_affiliation_string":"McGill University, Montreal, Quebec, Canada","institution_ids":["https://openalex.org/I5023651"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5036503505"],"corresponding_institution_ids":["https://openalex.org/I2801919071"],"apc_list":null,"apc_paid":null,"fwci":7.1122,"has_fulltext":false,"cited_by_count":111,"citation_normalized_percentile":{"value":0.97342966,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":"3","issue":"3","first_page":"27","last_page":"27"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9997000098228455,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9997000098228455,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9979000091552734,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9968000054359436,"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/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.7419103980064392},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6725289225578308},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.6694639921188354},{"id":"https://openalex.org/keywords/multi-commodity-flow-problem","display_name":"Multi-commodity flow problem","score":0.6497761011123657},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.6105736494064331},{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.5597088932991028},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.48457300662994385},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.47310566902160645},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4669545590877533},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.44732141494750977},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4240611791610718},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.41902562975883484},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.3785616159439087},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3508743643760681},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.23630020022392273}],"concepts":[{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.7419103980064392},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6725289225578308},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.6694639921188354},{"id":"https://openalex.org/C170334043","wikidata":"https://www.wikidata.org/wiki/Q6934437","display_name":"Multi-commodity flow problem","level":3,"score":0.6497761011123657},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.6105736494064331},{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.5597088932991028},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.48457300662994385},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.47310566902160645},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4669545590877533},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.44732141494750977},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4240611791610718},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.41902562975883484},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.3785616159439087},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3508743643760681},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.23630020022392273},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1273340.1273343","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1273340.1273343","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Partnerships for the goals","score":0.47999998927116394,"id":"https://metadata.un.org/sdg/17"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W49239469","https://openalex.org/W1548400851","https://openalex.org/W1591562949","https://openalex.org/W1608651920","https://openalex.org/W1963547452","https://openalex.org/W1989234747","https://openalex.org/W1994772417","https://openalex.org/W2003902046","https://openalex.org/W2005509629","https://openalex.org/W2012729006","https://openalex.org/W2019062750","https://openalex.org/W2034269606","https://openalex.org/W2069417991","https://openalex.org/W2079332713","https://openalex.org/W2102959253","https://openalex.org/W2104685111","https://openalex.org/W2104935810","https://openalex.org/W2116973503","https://openalex.org/W2119862441","https://openalex.org/W2132048723","https://openalex.org/W2140262267","https://openalex.org/W2153625179","https://openalex.org/W2154571828","https://openalex.org/W2160146903","https://openalex.org/W2564710011","https://openalex.org/W3014052784","https://openalex.org/W4301808069","https://openalex.org/W6603543317","https://openalex.org/W6996888795"],"related_works":["https://openalex.org/W132011890","https://openalex.org/W4231500168","https://openalex.org/W2980261836","https://openalex.org/W90079504","https://openalex.org/W2114997377","https://openalex.org/W2949496268","https://openalex.org/W2032436423","https://openalex.org/W3141113327","https://openalex.org/W2123087902","https://openalex.org/W3035974271"],"abstract_inverted_index":{"We":[0,176,241,253],"consider":[1,178],"requests":[2],"for":[3,119,149,169,223,237,261],"capacity":[4,27,196],"in":[5,71,172],"a":[6,35,45,62,77,116,128,229],"given":[7],"tree":[8,23,73],"network":[9,174],"T":[10],"=":[11],"(":[12],"V":[13],",":[14,199],"E":[15],")":[16],"where":[17],"each":[18],"edge":[19,195],"e":[20,29],"of":[21,64,139,152,206,227,244],"the":[22,53,72,85,98,120,136,140,150,179,185,193,203,207,220,224,238],"has":[24,166],"some":[25],"integer":[26,40,99],"u":[28,197],".":[30],"Each":[31],"request":[32,54],"f":[33,43,48],"is":[34,50,55,59,112,145,157,190,209,215,231],"node":[36],"pair":[37],"with":[38,181],"an":[39],"demand":[41,187,225],"d":[42,188],"and":[44,74,87,114,164,246,263,267],"profit":[46],"w":[47],"which":[49,75],"obtained":[51,216],"if":[52],"satisfied.":[56],"The":[57],"objective":[58],"to":[60,250,269],"find":[61],"set":[63],"demands":[65,93],"that":[66,109,135,202,219,236],"can":[67],"be":[68],"feasibly":[69],"routed":[70],"provides":[76],"maximum":[78,186],"profit.":[79],"This":[80,213],"generalizes":[81],"well-known":[82],"problems,":[83],"including":[84],"knapsack":[86],"b":[88],"-matching":[89],"problems.":[90],"When":[91,184],"all":[92],"are":[94,125,273],"1,":[95],"we":[96,200],"have":[97],"multicommodity":[100],"flow":[101],"problem.":[102],"Garg":[103],"et":[104],"al.":[105],"[1997]":[106],"had":[107],"shown":[108],"this":[110,165,257],"problem":[111,180,230],"NP-hard":[113],"gave":[115],"2-approximation":[117],"algorithm":[118],"cardinality":[121],"case":[122,151],"(all":[123],"profits":[124],"1)":[126],"via":[127,256],"primal-dual":[129],"algorithm.":[130],"Our":[131,155],"main":[132],"result":[133,214],"establishes":[134],"integrality":[137,204,221],"gap":[138,205,222],"natural":[141],"linear":[142],"programming":[143],"relaxation":[144],"at":[146,191,210,232],"most":[147,192,211,233],"4":[148],"arbitrary":[153,182],"profits.":[154],"proof":[156],"based":[158],"on":[159,162],"coloring":[160],"paths":[161],"trees":[163],"other":[167,270],"applications":[168],"wavelength":[170],"assignment":[171],"optical":[173],"routing.":[175],"then":[177],"demands.":[183],"max":[189],"minimum":[194],"min":[198],"show":[201],"LP":[208],"48.":[212],"by":[217],"showing":[218],"version":[226],"such":[228],"11.542":[234],"times":[235],"unit-demand":[239],"case.":[240],"use":[242],"techniques":[243],"Kolliopoulos":[245],"Stein":[247],"[2004,":[248],"2001]":[249],"obtain":[251],"this.":[252],"also":[254],"obtain,":[255],"method,":[258],"improved":[259],"algorithms":[260],"line":[262],"ring":[264],"networks.":[265],"Applications":[266],"connections":[268],"combinatorial":[271],"problems":[272],"discussed.":[274]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":7},{"year":2017,"cited_by_count":8},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":13},{"year":2013,"cited_by_count":10},{"year":2012,"cited_by_count":6}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}