{"id":"https://openalex.org/W2478461897","doi":"https://doi.org/10.1109/infocom.2016.7524408","title":"Network utility maximization with path cardinality constraints","display_name":"Network utility maximization with path cardinality constraints","publication_year":2016,"publication_date":"2016-04-01","ids":{"openalex":"https://openalex.org/W2478461897","doi":"https://doi.org/10.1109/infocom.2016.7524408","mag":"2478461897"},"language":"en","primary_location":{"id":"doi:10.1109/infocom.2016.7524408","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infocom.2016.7524408","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications","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/A5057565845","display_name":"Yingjie Bi","orcid":"https://orcid.org/0000-0001-5790-157X"},"institutions":[{"id":"https://openalex.org/I205783295","display_name":"Cornell University","ror":"https://ror.org/05bnh6r87","country_code":"US","type":"education","lineage":["https://openalex.org/I205783295"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Yingjie Bi","raw_affiliation_strings":["School of Electrical and Computer Engineering, Cornell University"],"affiliations":[{"raw_affiliation_string":"School of Electrical and Computer Engineering, Cornell University","institution_ids":["https://openalex.org/I205783295"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5079559561","display_name":"Chee Wei Tan","orcid":"https://orcid.org/0000-0002-6624-9752"},"institutions":[{"id":"https://openalex.org/I168719708","display_name":"City University of Hong Kong","ror":"https://ror.org/03q8dnn23","country_code":"HK","type":"education","lineage":["https://openalex.org/I168719708"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Chee Wei Tan","raw_affiliation_strings":["Department of Computer Science, City University of Hong Kong"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, City University of Hong Kong","institution_ids":["https://openalex.org/I168719708"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103277656","display_name":"Ao Tang","orcid":"https://orcid.org/0000-0001-6296-644X"},"institutions":[{"id":"https://openalex.org/I205783295","display_name":"Cornell University","ror":"https://ror.org/05bnh6r87","country_code":"US","type":"education","lineage":["https://openalex.org/I205783295"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ao Tang","raw_affiliation_strings":["School of Electrical and Computer Engineering, Cornell University"],"affiliations":[{"raw_affiliation_string":"School of Electrical and Computer Engineering, Cornell University","institution_ids":["https://openalex.org/I205783295"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5057565845"],"corresponding_institution_ids":["https://openalex.org/I205783295"],"apc_list":null,"apc_paid":null,"fwci":1.1581,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.81004534,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"9"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9988999962806702,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9988999962806702,"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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9955000281333923,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9954000115394592,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7163596749305725},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6914641857147217},{"id":"https://openalex.org/keywords/multipath-routing","display_name":"Multipath routing","score":0.6493076086044312},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6479648351669312},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.647436261177063},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.6216884851455688},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.5993772745132446},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5677456259727478},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5356438159942627},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4743731617927551},{"id":"https://openalex.org/keywords/path-vector-protocol","display_name":"Path vector protocol","score":0.46905115246772766},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3445132374763489},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.27496716380119324},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2539692223072052},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.1641763150691986},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.08469998836517334},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.06885737180709839}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7163596749305725},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6914641857147217},{"id":"https://openalex.org/C76522221","wikidata":"https://www.wikidata.org/wiki/Q5035396","display_name":"Multipath routing","level":5,"score":0.6493076086044312},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6479648351669312},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.647436261177063},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.6216884851455688},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.5993772745132446},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5677456259727478},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5356438159942627},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4743731617927551},{"id":"https://openalex.org/C128917274","wikidata":"https://www.wikidata.org/wiki/Q1666535","display_name":"Path vector protocol","level":5,"score":0.46905115246772766},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3445132374763489},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.27496716380119324},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2539692223072052},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.1641763150691986},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.08469998836517334},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.06885737180709839},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/infocom.2016.7524408","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infocom.2016.7524408","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1483034882","https://openalex.org/W1966109186","https://openalex.org/W2000354435","https://openalex.org/W2007309295","https://openalex.org/W2078519610","https://openalex.org/W2106007310","https://openalex.org/W2108801339","https://openalex.org/W2111944885","https://openalex.org/W2118442492","https://openalex.org/W2119273405","https://openalex.org/W2126956578","https://openalex.org/W2137583600","https://openalex.org/W2142480021","https://openalex.org/W2161615677","https://openalex.org/W2296319761","https://openalex.org/W4250589301","https://openalex.org/W6628945640","https://openalex.org/W6652167157"],"related_works":["https://openalex.org/W2002177687","https://openalex.org/W2058438338","https://openalex.org/W2019471580","https://openalex.org/W2941284322","https://openalex.org/W4224920876","https://openalex.org/W2168299207","https://openalex.org/W4308671316","https://openalex.org/W2124475651","https://openalex.org/W2585354854","https://openalex.org/W2751383119"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"study":[4],"network":[5],"utility":[6],"maximization":[7],"over":[8,91],"both":[9],"routing":[10,54,68],"choice":[11],"and":[12,45,71,81],"path":[13,19],"rate":[14],"assignment":[15],"for":[16,52],"any":[17],"given":[18],"cardinality":[20],"constraint.":[21],"We":[22],"provide":[23],"a":[24,31],"novel":[25],"convex":[26],"relaxation,":[27],"which":[28],"leads":[29],"to":[30,48,87],"randomized":[32,76],"algorithm":[33,43,77],"with":[34],"performance":[35,50,72],"guarantees.":[36],"The":[37],"new":[38],"relaxation":[39],"also":[40],"enables":[41],"distributed":[42],"design":[44],"allows":[46],"us":[47],"obtain":[49],"estimation":[51],"nonconvex":[53],"optimization":[55],"problems":[56],"that":[57],"is":[58],"significantly":[59],"better":[60],"than":[61],"previous":[62],"work":[63],"based":[64],"on":[65],"the":[66,74],"multipath":[67],"relaxation.":[69],"Convergence":[70],"of":[73],"proposed":[75],"are":[78],"characterized":[79],"theoretically":[80],"further":[82],"illustrated":[83],"numerically":[84],"through":[85],"examples":[86],"demonstrate":[88],"its":[89],"superiority":[90],"existing":[92],"work.":[93]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}