{"id":"https://openalex.org/W2086237997","doi":"https://doi.org/10.48550/arxiv.0904.2401","title":"A Combinatorial Study of Linear Deterministic Relay Networks","display_name":"A Combinatorial Study of Linear Deterministic Relay Networks","publication_year":2009,"publication_date":"2009-04-15","ids":{"openalex":"https://openalex.org/W2086237997","doi":"https://doi.org/10.48550/arxiv.0904.2401","mag":"2086237997"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:0904.2401","doi":null,"is_oa":true,"landing_page_url":"http://arxiv.org/abs/0904.2401","pdf_url":"https://arxiv.org/pdf/0904.2401","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"volume":null,"type":"preprint","is_traditional":true,"indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/0904.2401","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5072227716","display_name":"S. M. Sadegh Tabatabaei Yazdi","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yazdi, S. M. Sadegh Tabatabaei","raw_affiliation_strings":["Department of Electrical & Computer Engineering, Texas A&M University, College Station, 77843, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical & Computer Engineering, Texas A&M University, College Station, 77843, USA","institution_ids":["https://openalex.org/I91045830"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5009369454","display_name":"Serap A. Savari","orcid":"https://orcid.org/0000-0002-7451-4392","observed_orcids":["https://orcid.org/0000-0002-7451-4392"]},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Savari, Serap A.","raw_affiliation_strings":["Department of Electrical and Computer Engineering , Texas A&M University , College Station , TX 77843 USA","Department of Electrical & Computer Engineering, Texas A&M University, College Station, 77843, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering , Texas A&M University , College Station , TX 77843 USA","institution_ids":["https://openalex.org/I91045830"]},{"raw_affiliation_string":"Department of Electrical & Computer Engineering, Texas A&M University, College Station, 77843, USA","institution_ids":["https://openalex.org/I91045830"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I91045830"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":9,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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.8564000129699707,"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.8564000129699707,"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.13590000569820404,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.0010000000474974513,"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/max-flow-min-cut-theorem","display_name":"max-flow min-cut theorem","score":0.8299999833106995},{"id":"https://openalex.org/keywords/network-capacity","display_name":"network capacity","score":0.7110000252723694},{"id":"https://openalex.org/keywords/polymatroids","display_name":"polymatroids","score":0.7680000066757202},{"id":"https://openalex.org/keywords/submodularity","display_name":"submodular functions","score":0.8489999771118164},{"id":"https://openalex.org/keywords/submodular-function-minimization","display_name":"submodular function minimization","score":0.8669999837875366},{"id":"https://openalex.org/keywords/linear-programming","display_name":"linear programming","score":0.6190000176429749},{"id":"https://openalex.org/keywords/wireless-networks","display_name":"wireless networks","score":0.6420000195503235}],"concepts":[{"id":"https://openalex.org/C2778156585","wikidata":"https://www.wikidata.org/wiki/Q174053","display_name":"Relay","level":3,"score":0.6601858735084534},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.43781012296676636},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3990020453929901},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.13970541954040527},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C163258240","wikidata":"https://www.wikidata.org/wiki/Q25342","display_name":"Power (physics)","level":2,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:arXiv.org:0904.2401","doi":null,"is_oa":true,"landing_page_url":"http://arxiv.org/abs/0904.2401","pdf_url":"https://arxiv.org/pdf/0904.2401","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.313.5367","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.313.5367","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/0904.2401v1.pdf","raw_type":"text"},{"id":"doi:10.48550/arxiv.0904.2401","doi":"https://doi.org/10.48550/arxiv.0904.2401","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.0904.2401","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:0904.2401","doi":null,"is_oa":true,"landing_page_url":"http://arxiv.org/abs/0904.2401","pdf_url":"https://arxiv.org/pdf/0904.2401","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","score":0.4943999946117401,"id":"https://metadata.un.org/sdg/9"}],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2086237997.pdf","grobid_xml":"https://content.openalex.org/works/W2086237997.grobid-xml"},"referenced_works_count":9,"referenced_works":["https://openalex.org/W1604158939","https://openalex.org/W2012329067","https://openalex.org/W2035575256","https://openalex.org/W2044326680","https://openalex.org/W2045425530","https://openalex.org/W2051479030","https://openalex.org/W2125016043","https://openalex.org/W2340149117","https://openalex.org/W2990478921"],"related_works":["https://openalex.org/W2159865476","https://openalex.org/W2036424040","https://openalex.org/W1575646154","https://openalex.org/W2170580421","https://openalex.org/W2246541465","https://openalex.org/W1575405595","https://openalex.org/W7097714559","https://openalex.org/W2105589706","https://openalex.org/W7097755102","https://openalex.org/W7099823187"],"abstract_inverted_index":{"In":[0],"the":[1,5,21,33,49,54,92,125,134,159,162,186,199],"last":[2],"few":[3],"years":[4],"so--called":[6],"\"linear":[7],"deterministic\"":[8],"model":[9,34,169],"of":[10,19,23,35,56,87,110,114,127,137,139,161,164,188,206,221],"relay":[11,64],"channels":[12],"has":[13],"gained":[14],"popularity":[15],"as":[16,103,219],"a":[17,57,61,70,80,96,105,111,121,128,140,144,165,182,204],"means":[18],"studying":[20],"flow":[22],"information":[24],"over":[25,60,84,185],"wireless":[26],"communication":[27],"networks,":[28],"and":[29,170],"this":[30],"approach":[31,153],"generalizes":[32],"wireline":[36],"networks":[37,156],"which":[38,66,101],"is":[39,45,67],"standard":[40,214],"in":[41],"network":[42,65,123],"optimization.":[43],"There":[44],"recent":[46],"work":[47],"extending":[48],"celebrated":[50],"max--flow/min--cut":[51],"theorem":[52,132,205],"to":[53,154,225],"capacity":[55,163,201],"unicast":[58],"session":[59],"linear":[62,183,210],"deterministic":[63],"modeled":[68],"by":[69,79,180,202],"layered":[71],"directed":[72],"graph.":[73],"This":[74],"result":[75,94],"was":[76],"first":[77],"proved":[78],"random":[81],"coding":[82],"scheme":[83,119,176,196],"large":[85],"blocks":[86],"transmitted":[88,107],"signals.":[89,115],"We":[90,191,212],"demonstrate":[91],"same":[93],"with":[95],"simple,":[97],"deterministic,":[98],"polynomial--time":[99,223],"algorithm":[100,224],"takes":[102],"input":[104],"single":[106],"signal":[108],"instead":[109],"long":[112],"block":[113,148],"Our":[116],"capacity-achieving":[117,228],"transmission":[118,175,195,229],"for":[120,147,167],"two--layer":[122],"requires":[124],"extension":[126],"one--dimensional":[129],"Rado--Hall":[130],"transversal":[131],"on":[133],"independent":[135],"subsets":[136],"rows":[138],"row--partitioned":[141],"matrix":[142],"into":[143],"two--dimensional":[145],"variation":[146],"matrices.":[149],"To":[150],"generalize":[151],"our":[152,168,173,194,222,227],"larger":[155],"we":[157],"use":[158,213],"submodularity":[160],"cut":[166],"show":[171],"that":[172,193],"complete":[174],"can":[177,197],"be":[178],"obtained":[179],"solving":[181],"program":[184],"intersection":[187],"two":[189],"polymatroids.":[190],"prove":[192],"achieve":[198],"max-flow/min-cut":[200],"applying":[203],"Edmonds":[207],"about":[208],"such":[209],"programs.":[211],"submodular":[215],"function":[216],"minimization":[217],"techniques":[218],"part":[220],"construct":[226],"scheme.":[230]},"counts_by_year":[{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-11-07T11:25:07.637180","created_date":"2016-06-24T00:00:00"}