{"id":"https://openalex.org/W2102760493","doi":"https://doi.org/10.1109/infcom.2009.5061962","title":"Polynomial Time Approximations for Multi-Path Routing with Bandwidth and Delay Constraints","display_name":"Polynomial Time Approximations for Multi-Path Routing with Bandwidth and Delay Constraints","publication_year":2009,"publication_date":"2009-04-01","ids":{"openalex":"https://openalex.org/W2102760493","doi":"https://doi.org/10.1109/infcom.2009.5061962","mag":"2102760493"},"language":"en","primary_location":{"id":"doi:10.1109/infcom.2009.5061962","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infcom.2009.5061962","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2009","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/A5029387062","display_name":"Satyajayant Misra","orcid":"https://orcid.org/0000-0001-7347-984X"},"institutions":[{"id":"https://openalex.org/I55732556","display_name":"Arizona State University","ror":"https://ror.org/03efmqc40","country_code":"US","type":"education","lineage":["https://openalex.org/I55732556"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"S. Misra","raw_affiliation_strings":["CSE Dept., Arizona State Univ., Tempe, AZ","CSE Department, Arizona State Univ., Tempe, AZ#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CSE Dept., Arizona State Univ., Tempe, AZ","institution_ids":["https://openalex.org/I55732556"]},{"raw_affiliation_string":"CSE Department, Arizona State Univ., Tempe, AZ#TAB#","institution_ids":["https://openalex.org/I55732556"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5026230689","display_name":"Guoliang Xue","orcid":"https://orcid.org/0000-0002-5833-8894"},"institutions":[{"id":"https://openalex.org/I55732556","display_name":"Arizona State University","ror":"https://ror.org/03efmqc40","country_code":"US","type":"education","lineage":["https://openalex.org/I55732556"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"G. Xue","raw_affiliation_strings":["CSE Dept., Arizona State Univ., Tempe, AZ","CSE Department, Arizona State Univ., Tempe, AZ#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CSE Dept., Arizona State Univ., Tempe, AZ","institution_ids":["https://openalex.org/I55732556"]},{"raw_affiliation_string":"CSE Department, Arizona State Univ., Tempe, AZ#TAB#","institution_ids":["https://openalex.org/I55732556"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5048130147","display_name":"Dejun Yang","orcid":"https://orcid.org/0000-0002-1811-4423"},"institutions":[{"id":"https://openalex.org/I55732556","display_name":"Arizona State University","ror":"https://ror.org/03efmqc40","country_code":"US","type":"education","lineage":["https://openalex.org/I55732556"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"D. Yang","raw_affiliation_strings":["CSE Dept., Arizona State Univ., Tempe, AZ","CSE Department, Arizona State Univ., Tempe, AZ#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CSE Dept., Arizona State Univ., Tempe, AZ","institution_ids":["https://openalex.org/I55732556"]},{"raw_affiliation_string":"CSE Department, Arizona State Univ., Tempe, AZ#TAB#","institution_ids":["https://openalex.org/I55732556"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I55732556"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":56,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"558","last_page":"566"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10138","display_name":"Network Traffic and Congestion Control","score":0.9997000098228455,"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"}},"topics":[{"id":"https://openalex.org/T10138","display_name":"Network Traffic and Congestion Control","score":0.9997000098228455,"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/T10847","display_name":"Advanced Optical Network Technologies","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9991000294685364,"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/bandwidth","display_name":"Bandwidth (computing)","score":0.7147330045700073},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6276829242706299},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6077286601066589},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5173177719116211},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5152754783630371},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5143119096755981},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.47420981526374817},{"id":"https://openalex.org/keywords/bandwidth-allocation","display_name":"Bandwidth allocation","score":0.4479592740535736},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.44713541865348816},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.44226527214050293},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4385470747947693},{"id":"https://openalex.org/keywords/consistent-heuristic","display_name":"Consistent heuristic","score":0.43615925312042236},{"id":"https://openalex.org/keywords/elmore-delay","display_name":"Elmore delay","score":0.4130549132823944},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.3549835979938507},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3365247845649719},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3354681730270386},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.21889221668243408},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.1979716420173645},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.15680870413780212},{"id":"https://openalex.org/keywords/propagation-delay","display_name":"Propagation delay","score":0.1419837474822998},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.11253485083580017},{"id":"https://openalex.org/keywords/incremental-heuristic-search","display_name":"Incremental heuristic search","score":0.07593220472335815}],"concepts":[{"id":"https://openalex.org/C2776257435","wikidata":"https://www.wikidata.org/wiki/Q1576430","display_name":"Bandwidth (computing)","level":2,"score":0.7147330045700073},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6276829242706299},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6077286601066589},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5173177719116211},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5152754783630371},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5143119096755981},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.47420981526374817},{"id":"https://openalex.org/C200157131","wikidata":"https://www.wikidata.org/wiki/Q4854763","display_name":"Bandwidth allocation","level":3,"score":0.4479592740535736},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.44713541865348816},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.44226527214050293},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4385470747947693},{"id":"https://openalex.org/C200246849","wikidata":"https://www.wikidata.org/wiki/Q5163226","display_name":"Consistent heuristic","level":5,"score":0.43615925312042236},{"id":"https://openalex.org/C84434228","wikidata":"https://www.wikidata.org/wiki/Q4531332","display_name":"Elmore delay","level":4,"score":0.4130549132823944},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.3549835979938507},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3365247845649719},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3354681730270386},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.21889221668243408},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.1979716420173645},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.15680870413780212},{"id":"https://openalex.org/C90806461","wikidata":"https://www.wikidata.org/wiki/Q1144416","display_name":"Propagation delay","level":2,"score":0.1419837474822998},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.11253485083580017},{"id":"https://openalex.org/C139979381","wikidata":"https://www.wikidata.org/wiki/Q17056021","display_name":"Incremental heuristic search","level":4,"score":0.07593220472335815},{"id":"https://openalex.org/C174086752","wikidata":"https://www.wikidata.org/wiki/Q5253471","display_name":"Delay calculation","level":3,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"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/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/infcom.2009.5061962","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infcom.2009.5061962","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2009","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.163.3784","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.163.3784","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.public.asu.edu/~dyang16/doc/INFOCOM2009-MultiQos.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.727.9662","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.727.9662","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.nmsu.edu/%7Emisra/papers/Infocom-2009.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":43,"referenced_works":["https://openalex.org/W1547286500","https://openalex.org/W1901465255","https://openalex.org/W1946507112","https://openalex.org/W1964119857","https://openalex.org/W1968268863","https://openalex.org/W1991578470","https://openalex.org/W2011039300","https://openalex.org/W2030170468","https://openalex.org/W2064946863","https://openalex.org/W2074117023","https://openalex.org/W2096774592","https://openalex.org/W2097208618","https://openalex.org/W2097985567","https://openalex.org/W2099860216","https://openalex.org/W2105808107","https://openalex.org/W2108547436","https://openalex.org/W2109982221","https://openalex.org/W2110383938","https://openalex.org/W2114525688","https://openalex.org/W2118876820","https://openalex.org/W2119775299","https://openalex.org/W2125413188","https://openalex.org/W2130626677","https://openalex.org/W2137190983","https://openalex.org/W2137741588","https://openalex.org/W2145850323","https://openalex.org/W2148229615","https://openalex.org/W2154281560","https://openalex.org/W2157993733","https://openalex.org/W2160658249","https://openalex.org/W2161591474","https://openalex.org/W2162689181","https://openalex.org/W2170193147","https://openalex.org/W2170358592","https://openalex.org/W2243986870","https://openalex.org/W2599168675","https://openalex.org/W2752885492","https://openalex.org/W3004540582","https://openalex.org/W3152126650","https://openalex.org/W6677240351","https://openalex.org/W6681946680","https://openalex.org/W6682829558","https://openalex.org/W6685121600"],"related_works":["https://openalex.org/W2019018557","https://openalex.org/W2140647291","https://openalex.org/W2185418236","https://openalex.org/W2134769100","https://openalex.org/W289155764","https://openalex.org/W3095560400","https://openalex.org/W2124726667","https://openalex.org/W2735803263","https://openalex.org/W1971470866","https://openalex.org/W1487981883"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,48],"study":[4],"the":[5,31,61,64,70,74,79,87,90,107,144,148,151,154,160,169,175,179],"problem":[6,83],"of":[7,54,63,73,76,89,103,147,153,171,178],"multi-path":[8],"routing":[9],"with":[10,134],"bandwidth":[11,23,35,46,72,80],"and":[12,36,44,86,143],"delay":[13,62],"constraints,":[14],"which":[15],"arises":[16],"in":[17,30,141],"applications":[18],"for":[19],"video":[20],"delivery":[21],"over":[22,174],"limited":[24],"networks.":[25],"Assume":[26],"that":[27,60,106,126],"each":[28],"link":[29],"network":[32],"has":[33],"a":[34,37,40,45,52,93,101,120,129,139],"delay.":[38],"For":[39],"given":[41],"source-destination":[42],"pair":[43],"requirement,":[47],"want":[49],"to":[50,56],"find":[51],"set":[53,75],"source":[55],"destination":[57],"paths":[58,77],"such":[59],"longest":[65],"path":[66],"is":[67,84,92,159],"minimized":[68],"while":[69],"aggregated":[71],"meets":[78],"requirement.":[81],"This":[82],"NP-hard,":[85],"state":[88,177],"art":[91],"maximum":[94,108],"flow":[95,109],"based":[96,110],"heuristic.":[97],"We":[98,117,163],"first":[99],"construct":[100],"class":[102],"examples":[104],"showing":[105],"heuristic":[111],"could":[112],"have":[113],"very":[114],"bad":[115],"performance.":[116],"then":[118],"present":[119,165],"fully":[121],"polynomial":[122,140],"time":[123,136],"approximation":[124,157],"scheme":[125,158,173],"can":[127],"compute":[128],"(1":[130],"+":[131],"epsiv)":[132],"-approximation":[133],"running":[135],"bounded":[137],"by":[138],"1/epsiv":[142],"input":[145],"size":[146],"instance.":[149],"Given":[150],"NP-hardness":[152],"problem,":[155],"our":[156,172],"best":[161],"possible.":[162],"also":[164],"numerical":[166],"results":[167],"confirming":[168],"advantage":[170],"current":[176],"art.":[180]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":6}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}