{"id":"https://openalex.org/W2158113152","doi":"https://doi.org/10.1109/isit.2012.6283557","title":"An information-theoretic meta-theorem on edge-cut bounds","display_name":"An information-theoretic meta-theorem on edge-cut bounds","publication_year":2012,"publication_date":"2012-07-01","ids":{"openalex":"https://openalex.org/W2158113152","doi":"https://doi.org/10.1109/isit.2012.6283557","mag":"2158113152"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2012.6283557","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2012.6283557","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE International Symposium on Information Theory Proceedings","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/A5044647069","display_name":"Sudeep Kamath","orcid":"https://orcid.org/0000-0002-9907-6632"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sudeep Kamath","raw_affiliation_strings":["EECS Department, University of California, Berkeley, Berkeley, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"EECS Department, University of California, Berkeley, Berkeley, CA, USA","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5053980484","display_name":"Pramod Viswanath","orcid":"https://orcid.org/0000-0003-3171-8667"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Pramod Viswanath","raw_affiliation_strings":["CSL and Department of ECE, UIUC, IL, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CSL and Department of ECE, UIUC, IL, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.4148,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.82012517,"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":"1657","last_page":"1661"},"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.9998999834060669,"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.9998999834060669,"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.9962999820709229,"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.9955999851226807,"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/unicast","display_name":"Unicast","score":0.8492158651351929},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.6126810908317566},{"id":"https://openalex.org/keywords/wireline","display_name":"Wireline","score":0.5852006673812866},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.5845687985420227},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.5170760154724121},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.4979119300842285},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4886177182197571},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.48328688740730286},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.46032822132110596},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.44777509570121765},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.400188148021698},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.39799851179122925},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.1593175232410431},{"id":"https://openalex.org/keywords/multicast","display_name":"Multicast","score":0.14541873335838318},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.08397579193115234}],"concepts":[{"id":"https://openalex.org/C11704745","wikidata":"https://www.wikidata.org/wiki/Q918337","display_name":"Unicast","level":3,"score":0.8492158651351929},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.6126810908317566},{"id":"https://openalex.org/C2776951270","wikidata":"https://www.wikidata.org/wiki/Q8026910","display_name":"Wireline","level":3,"score":0.5852006673812866},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.5845687985420227},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.5170760154724121},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4979119300842285},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4886177182197571},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.48328688740730286},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.46032822132110596},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.44777509570121765},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.400188148021698},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.39799851179122925},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.1593175232410431},{"id":"https://openalex.org/C32295351","wikidata":"https://www.wikidata.org/wiki/Q899288","display_name":"Multicast","level":2,"score":0.14541873335838318},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.08397579193115234},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"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/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/isit.2012.6283557","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2012.6283557","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE International Symposium on Information Theory Proceedings","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.840.8263","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.840.8263","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.princeton.edu/%7Esukamath/papers/information_theoretic_meta_theorem_KamathViswanath.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W192261506","https://openalex.org/W1509960805","https://openalex.org/W1576471153","https://openalex.org/W1976329386","https://openalex.org/W1984595105","https://openalex.org/W1986291656","https://openalex.org/W1999544087","https://openalex.org/W2009924457","https://openalex.org/W2091004914","https://openalex.org/W2103320637","https://openalex.org/W2105831729","https://openalex.org/W2121205191","https://openalex.org/W2125278290","https://openalex.org/W2132123317","https://openalex.org/W2137690813","https://openalex.org/W2141353198","https://openalex.org/W2154876245","https://openalex.org/W2159454021","https://openalex.org/W2160882291","https://openalex.org/W2167061810","https://openalex.org/W2168505046","https://openalex.org/W2176446742","https://openalex.org/W2325997012","https://openalex.org/W6630392932"],"related_works":["https://openalex.org/W2368190399","https://openalex.org/W4200241224","https://openalex.org/W2374510365","https://openalex.org/W1964703610","https://openalex.org/W2085787479","https://openalex.org/W2759444425","https://openalex.org/W4246159570","https://openalex.org/W2381888053","https://openalex.org/W2356623904","https://openalex.org/W2085986895"],"abstract_inverted_index":{"We":[0,103,174],"consider":[1],"the":[2,18,36,45,76,97,107,134,142,145,172,194,199],"problem":[3,46],"of":[4,50,68,96,109,150,158,161,180],"multiple":[5],"unicast":[6,115],"in":[7,26,79,106,111,116,152,171,178,193,198],"wireline":[8],"networks.":[9],"Edge-cut":[10],"based":[11,57,85],"bounds":[12,16,34,58,86,204],"which":[13,162],"are":[14,24,31,59,87,205],"simple":[15],"on":[17,35],"rates":[19],"achievable":[20],"by":[21],"routing":[22],"flow":[23],"not":[25,32],"general,":[27],"fundamental,":[28],"i.e.":[29,61,122,155],"they":[30],"outer":[33],"capacity":[37,98],"region.":[38],"It":[39],"has":[40,47,163],"been":[41],"observed":[42],"that":[43,78],"when":[44],"some":[48],"kind":[49],"symmetry":[51,191],"involved,":[52],"then":[53,202],"flows":[54,208],"and":[55,148,207],"edge-cut":[56,84,203],"`close',":[60],"within":[62],"a":[63,128,131,156,185],"constant":[64],"or":[65,197],"poly-logarithmic":[66],"factor":[67],"each":[69,160],"other.":[70],"In":[71],"this":[72,105],"paper,":[73],"we":[74],"make":[75],"observation":[77],"these":[80,101],"very":[81],"cases,":[82],"such":[83],"actually":[88],"`close'":[89],"to":[90,127,141,183],"fundamental":[91],"yielding":[92],"an":[93,137,164],"approximate":[94],"characterization":[95],"region":[99],"for":[100,123,167],"problems.":[102],"demonstrate":[104],"case":[108],"k-unicast":[110],"undirected":[112],"networks,":[113,154],"k-pair":[114],"directed":[117,153],"networks":[118],"with":[119],"symmetric":[120],"demands":[121],"every":[124,168],"source":[125,143],"communicating":[126],"destination":[129,135],"at":[130,144],"certain":[132],"rate,":[133,147],"communicates":[136],"independent":[138,165],"message":[139,166],"back":[140],"same":[146],"sum-rate":[149],"k-groupcast":[151],"group":[157],"nodes,":[159],"other":[169],"node":[170],"group.":[173],"place":[175],"our":[176],"work":[177],"context":[179],"existing":[181],"results":[182],"suggest":[184],"meta-theorem:":[186],"if":[187],"there":[188],"is":[189],"inherent":[190],"either":[192],"network":[195],"connectivity":[196],"traffic":[200],"pattern,":[201],"near-fundamental":[206],"approximately":[209],"achieve":[210],"capacity.":[211]},"counts_by_year":[{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}