{"id":"https://openalex.org/W2002190550","doi":"https://doi.org/10.1109/tit.2013.2295099","title":"Efficient Capacity Computation and Power Optimization for Relay Networks","display_name":"Efficient Capacity Computation and Power Optimization for Relay Networks","publication_year":2014,"publication_date":"2014-01-31","ids":{"openalex":"https://openalex.org/W2002190550","doi":"https://doi.org/10.1109/tit.2013.2295099","mag":"2002190550"},"language":"en","primary_location":{"id":"doi:10.1109/tit.2013.2295099","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2013.2295099","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","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/A5006066917","display_name":"Farzad Parvaresh","orcid":"https://orcid.org/0000-0001-5292-0915"},"institutions":[{"id":"https://openalex.org/I39268498","display_name":"University of Isfahan","ror":"https://ror.org/05h9t7759","country_code":"IR","type":"education","lineage":["https://openalex.org/I39268498"]}],"countries":["IR"],"is_corresponding":true,"raw_author_name":"Farzad Parvaresh","raw_affiliation_strings":["Department of Electrical Engineering, University of Isfahan, Isfahan, Iran","Dept. of Electr. Eng., Univ. of Isfahan, Isfahan, Iran"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, University of Isfahan, Isfahan, Iran","institution_ids":["https://openalex.org/I39268498"]},{"raw_affiliation_string":"Dept. of Electr. Eng., Univ. of Isfahan, Isfahan, Iran","institution_ids":["https://openalex.org/I39268498"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5032571804","display_name":"Ra\u00fal Etkin","orcid":null},"institutions":[{"id":"https://openalex.org/I4210101778","display_name":"Samsung (United States)","ror":"https://ror.org/01bfbvm65","country_code":"US","type":"company","lineage":["https://openalex.org/I2250650973","https://openalex.org/I4210101778"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Raul Etkin","raw_affiliation_strings":["Samsung Information Systems America, San Jose, CA, USA","Samsung Information Systems, America, San Jose, CA, USA"],"affiliations":[{"raw_affiliation_string":"Samsung Information Systems America, San Jose, CA, USA","institution_ids":["https://openalex.org/I4210101778"]},{"raw_affiliation_string":"Samsung Information Systems, America, San Jose, CA, USA","institution_ids":["https://openalex.org/I4210101778"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5006066917"],"corresponding_institution_ids":["https://openalex.org/I39268498"],"apc_list":null,"apc_paid":null,"fwci":6.2066,"has_fulltext":false,"cited_by_count":25,"citation_normalized_percentile":{"value":0.96619621,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"60","issue":"3","first_page":"1782","last_page":"1792"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":1.0,"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":1.0,"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/T10964","display_name":"Wireless Communication Security Techniques","score":0.9905999898910522,"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/T10148","display_name":"Advanced MIMO Systems Optimization","score":0.9728999733924866,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/submodular-set-function","display_name":"Submodular set function","score":0.7311245203018188},{"id":"https://openalex.org/keywords/relay","display_name":"Relay","score":0.6329331398010254},{"id":"https://openalex.org/keywords/gaussian","display_name":"Gaussian","score":0.5825580358505249},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5716956257820129},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5454389452934265},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.49460694193840027},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.47760769724845886},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4762064218521118},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4465934634208679},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.42921721935272217},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.42084991931915283},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.40349340438842773},{"id":"https://openalex.org/keywords/power","display_name":"Power (physics)","score":0.29429978132247925},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2653277814388275}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.7311245203018188},{"id":"https://openalex.org/C2778156585","wikidata":"https://www.wikidata.org/wiki/Q174053","display_name":"Relay","level":3,"score":0.6329331398010254},{"id":"https://openalex.org/C163716315","wikidata":"https://www.wikidata.org/wiki/Q901177","display_name":"Gaussian","level":2,"score":0.5825580358505249},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5716956257820129},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5454389452934265},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.49460694193840027},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.47760769724845886},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4762064218521118},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4465934634208679},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.42921721935272217},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.42084991931915283},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.40349340438842773},{"id":"https://openalex.org/C163258240","wikidata":"https://www.wikidata.org/wiki/Q25342","display_name":"Power (physics)","level":2,"score":0.29429978132247925},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2653277814388275},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"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/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tit.2013.2295099","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2013.2295099","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/7","display_name":"Affordable and clean energy","score":0.4300000071525574}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W1486950299","https://openalex.org/W1528321597","https://openalex.org/W1568307856","https://openalex.org/W1576820654","https://openalex.org/W1802395297","https://openalex.org/W1973248112","https://openalex.org/W2012329067","https://openalex.org/W2021182061","https://openalex.org/W2022049946","https://openalex.org/W2050511894","https://openalex.org/W2098567664","https://openalex.org/W2099061975","https://openalex.org/W2099111195","https://openalex.org/W2100440346","https://openalex.org/W2105589706","https://openalex.org/W2106765508","https://openalex.org/W2107325229","https://openalex.org/W2109962983","https://openalex.org/W2123350510","https://openalex.org/W2139709283","https://openalex.org/W2153194902","https://openalex.org/W2167447263","https://openalex.org/W2170580421","https://openalex.org/W2246541465","https://openalex.org/W2552318507","https://openalex.org/W2963318404","https://openalex.org/W4239797293","https://openalex.org/W4250589301","https://openalex.org/W6629087766","https://openalex.org/W6638211556","https://openalex.org/W6671818062"],"related_works":["https://openalex.org/W1595919516","https://openalex.org/W2945022594","https://openalex.org/W2966531942","https://openalex.org/W2950365512","https://openalex.org/W1608444752","https://openalex.org/W3204684126","https://openalex.org/W2062310236","https://openalex.org/W3013568067","https://openalex.org/W4299354108","https://openalex.org/W4313343266"],"abstract_inverted_index":{"The":[0],"capacity":[1,5,35,46,87,121],"or":[2,82],"approximations":[3,118],"to":[4,77,85,119,149,184,188,211,238],"of":[6,18,28,47,61,122,135,145,156,178,181,196,233,242],"various":[7],"single-source":[8],"single-destination":[9],"relay":[10,49,100,124],"network":[11,50,101,247],"models":[12,102],"has":[13],"been":[14],"characterized":[15],"in":[16,106,133,167,194,202,228],"terms":[17,195],"the":[19,33,43,80,86,93,120,146,150,176,179,185,203,229,234],"cut-set":[20,140,197],"upper":[21],"bound.":[22],"In":[23,171],"principle,":[24],"a":[25,48,59,62,67,89,154,168,189,208,239],"direct":[26],"computation":[27],"this":[29,75,213],"bound":[30],"requires":[31],"evaluating":[32],"cut":[34,45],"over":[36],"exponentially":[37],"many":[38],"cuts.":[39],"We":[40,73,109,152,206,225],"show":[41,78,161,174],"that":[42,79,115,162,175,227,246],"minimum":[44,190],"under":[51],"some":[52,111],"special":[53],"assumptions":[54],"can":[55,69,103,130,164,199],"be":[56,70,104,131,165,200,250],"cast":[57],"as":[58,66],"minimization":[60,177],"submodular":[63],"function,":[64],"and":[65,97,160,215],"result,":[68],"computed":[71,105,201],"efficiently.":[72],"use":[74],"result":[76],"capacity,":[81],"an":[83],"approximation":[84],"within":[88],"constant":[90],"gap":[91],"for":[92],"Gaussian,":[94],"wireless":[95],"erasure,":[96],"Avestimehr-Diggavi-Tse":[98],"deterministic":[99],"polynomial":[107,169,204],"time.":[108,170,205],"present":[110],"empirical":[112],"results":[113],"showing":[114],"computing":[116],"constant-gap":[117],"Gaussian":[123,138,223],"networks":[125],"with":[126],"around":[127],"300":[128],"nodes":[129,186],"done":[132],"order":[134],"minutes.":[136],"For":[137],"networks,":[139],"capacities":[141],"are":[142],"also":[143],"functions":[144],"powers":[147,182],"assigned":[148,183,237],"nodes.":[151],"consider":[153],"family":[155],"power":[157,235],"optimization":[158],"problems":[159],"they":[163],"solved":[166],"particular,":[172],"we":[173],"sum":[180],"subject":[187],"rate":[191],"constraint":[192],"(measured":[193],"bounds)":[198],"propose":[207],"heuristic":[209],"algorithm":[210],"solve":[212],"problem":[214],"measure":[216],"its":[217],"performance":[218,254],"through":[219],"simulations":[220],"on":[221],"random":[222],"networks.":[224],"observe":[226],"optimal":[230],"allocations,":[231],"most":[232],"is":[236],"small":[240],"subset":[241],"relays,":[243],"which":[244],"suggests":[245],"simplification":[248],"may":[249],"possible":[251],"without":[252],"excessive":[253],"degradation.":[255]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":9},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}