{"id":"https://openalex.org/W2139709283","doi":"https://doi.org/10.1109/allerton.2010.5707000","title":"Improved combinatorial algorithms for wireless information flow","display_name":"Improved combinatorial algorithms for wireless information flow","publication_year":2010,"publication_date":"2010-09-01","ids":{"openalex":"https://openalex.org/W2139709283","doi":"https://doi.org/10.1109/allerton.2010.5707000","mag":"2139709283"},"language":"en","primary_location":{"id":"doi:10.1109/allerton.2010.5707000","is_oa":false,"landing_page_url":"https://doi.org/10.1109/allerton.2010.5707000","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","raw_type":"proceedings-article"},"type":"preprint","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/A5103832465","display_name":"Cuizhu Shi","orcid":null},"institutions":[{"id":"https://openalex.org/I173911158","display_name":"Iowa State University","ror":"https://ror.org/04rswrd78","country_code":"US","type":"education","lineage":["https://openalex.org/I173911158"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Cuizhu Shi","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Iowa State University, Ames, IA, USA","Department of Electrical & Computer Engineering, Iowa State University, Ames, 50011 USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Iowa State University, Ames, IA, USA","institution_ids":["https://openalex.org/I173911158"]},{"raw_affiliation_string":"Department of Electrical & Computer Engineering, Iowa State University, Ames, 50011 USA","institution_ids":["https://openalex.org/I173911158"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5055656185","display_name":"Aditya Ramamoorthy","orcid":"https://orcid.org/0000-0003-3448-1271"},"institutions":[{"id":"https://openalex.org/I173911158","display_name":"Iowa State University","ror":"https://ror.org/04rswrd78","country_code":"US","type":"education","lineage":["https://openalex.org/I173911158"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Aditya Ramamoorthy","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Iowa State University, Ames, IA, USA","Department of Electrical & Computer Engineering, Iowa State University, Ames, 50011 USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Iowa State University, Ames, IA, USA","institution_ids":["https://openalex.org/I173911158"]},{"raw_affiliation_string":"Department of Electrical & Computer Engineering, Iowa State University, Ames, 50011 USA","institution_ids":["https://openalex.org/I173911158"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5103832465"],"corresponding_institution_ids":["https://openalex.org/I173911158"],"apc_list":null,"apc_paid":null,"fwci":0.7451,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.75746273,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"875","last_page":"880"},"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/T11130","display_name":"Coding theory and cryptography","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10575","display_name":"Wireless Communication Networks Research","score":0.9979000091552734,"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/unicast","display_name":"Unicast","score":0.8293845653533936},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6712921261787415},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6198446154594421},{"id":"https://openalex.org/keywords/wireless","display_name":"Wireless","score":0.6100426912307739},{"id":"https://openalex.org/keywords/adjacency-list","display_name":"Adjacency list","score":0.57293301820755},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5650148987770081},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5325865745544434},{"id":"https://openalex.org/keywords/wireless-network","display_name":"Wireless network","score":0.48865655064582825},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.47969934344291687},{"id":"https://openalex.org/keywords/information-flow","display_name":"Information flow","score":0.4620288014411926},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.45808708667755127},{"id":"https://openalex.org/keywords/adjacency-matrix","display_name":"Adjacency matrix","score":0.43379828333854675},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3864011764526367},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2602829337120056},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.1797543168067932},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.12050357460975647},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.11927980184555054},{"id":"https://openalex.org/keywords/multicast","display_name":"Multicast","score":0.1162269115447998}],"concepts":[{"id":"https://openalex.org/C11704745","wikidata":"https://www.wikidata.org/wiki/Q918337","display_name":"Unicast","level":3,"score":0.8293845653533936},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6712921261787415},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6198446154594421},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.6100426912307739},{"id":"https://openalex.org/C110484373","wikidata":"https://www.wikidata.org/wiki/Q264398","display_name":"Adjacency list","level":2,"score":0.57293301820755},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5650148987770081},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5325865745544434},{"id":"https://openalex.org/C108037233","wikidata":"https://www.wikidata.org/wiki/Q11375","display_name":"Wireless network","level":3,"score":0.48865655064582825},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.47969934344291687},{"id":"https://openalex.org/C2779136372","wikidata":"https://www.wikidata.org/wiki/Q10283002","display_name":"Information flow","level":2,"score":0.4620288014411926},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.45808708667755127},{"id":"https://openalex.org/C180356752","wikidata":"https://www.wikidata.org/wiki/Q727035","display_name":"Adjacency matrix","level":3,"score":0.43379828333854675},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3864011764526367},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2602829337120056},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.1797543168067932},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.12050357460975647},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.11927980184555054},{"id":"https://openalex.org/C32295351","wikidata":"https://www.wikidata.org/wiki/Q899288","display_name":"Multicast","level":2,"score":0.1162269115447998},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/allerton.2010.5707000","is_oa":false,"landing_page_url":"https://doi.org/10.1109/allerton.2010.5707000","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","raw_type":"proceedings-article"},{"id":"pmh:oai:lib.dr.iastate.edu:ece_conf-1025","is_oa":false,"landing_page_url":"https://lib.dr.iastate.edu/cgi/viewcontent.cgi?article=1025&context=ece_conf","pdf_url":null,"source":{"id":"https://openalex.org/S4377196104","display_name":"Iowa State University Digital Repository (Iowa State University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I173911158","host_organization_name":"Iowa State University","host_organization_lineage":["https://openalex.org/I173911158"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Electrical and Computer Engineering Conference Papers, Posters and Presentations","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.753.1078","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.753.1078","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/1010.1331.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure","score":0.44999998807907104}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1802395297","https://openalex.org/W2048652909","https://openalex.org/W2099061975","https://openalex.org/W2106765508","https://openalex.org/W2109962983","https://openalex.org/W2246541465","https://openalex.org/W2295428206","https://openalex.org/W2752885492","https://openalex.org/W2951703455","https://openalex.org/W2963318404","https://openalex.org/W3004540582","https://openalex.org/W3145128584","https://openalex.org/W4231916799","https://openalex.org/W6638211556","https://openalex.org/W6671818062","https://openalex.org/W6685321735"],"related_works":["https://openalex.org/W4213150077","https://openalex.org/W2369410163","https://openalex.org/W2059018062","https://openalex.org/W2604585036","https://openalex.org/W2078477160","https://openalex.org/W1989103179","https://openalex.org/W1991172810","https://openalex.org/W125803343","https://openalex.org/W2117632582","https://openalex.org/W4388347373"],"abstract_inverted_index":{"The":[0],"work":[1,70],"of":[2,22,29,51,77,98,123],"Avestimehr":[3],"et":[4],"al.":[5],"'07":[6],"has":[7],"recently":[8],"proposed":[9,42],"a":[10,43,52],"deterministic":[11,54],"model":[12],"for":[13,46],"wireless":[14,55],"networks":[15,24],"and":[16,71],"characterized":[17],"the":[18,26,30,48,74,78,83,89,103,112],"unicast":[19,49],"capacity":[20,50],"C":[21],"such":[23],"as":[25],"minimum":[27],"rank":[28],"adjacency":[31],"matrices":[32],"describing":[33],"all":[34],"possible":[35],"source-destination":[36],"cuts.":[37],"Amaudruz":[38,67],"&":[39,68],"Fragouli":[40],"first":[41],"polynomial-time":[44],"algorithm":[45,79,117],"finding":[47],"linear":[53],"network":[56],"in":[57,88,121],"their":[58],"2009":[59],"paper.":[60],"In":[61],"this":[62],"work,":[63],"we":[64],"improve":[65],"upon":[66],"Fragouli's":[69],"further":[72],"reduce":[73],"computational":[75],"complexity":[76],"by":[80],"fully":[81],"exploring":[82],"useful":[84],"combinatorial":[85],"features":[86],"intrinsic":[87],"problem.":[90],"Our":[91],"improvement":[92],"applies":[93],"generally":[94],"with":[95,102,107],"any":[96],"size":[97],"finite":[99],"fields":[100],"associated":[101],"channel":[104],"model.":[105],"Comparing":[106],"other":[108],"algorithms":[109],"on":[110],"solving":[111],"same":[113],"problem,":[114],"our":[115],"improved":[116],"is":[118],"very":[119],"competitive":[120],"terms":[122],"complexity.":[124]},"counts_by_year":[{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}