{"id":"https://openalex.org/W2034358802","doi":"https://doi.org/10.1109/netcod.2013.6570835","title":"Multicut lower bounds via network coding","display_name":"Multicut lower bounds via network coding","publication_year":2013,"publication_date":"2013-06-01","ids":{"openalex":"https://openalex.org/W2034358802","doi":"https://doi.org/10.1109/netcod.2013.6570835","mag":"2034358802"},"language":"en","primary_location":{"id":"doi:10.1109/netcod.2013.6570835","is_oa":false,"landing_page_url":"https://doi.org/10.1109/netcod.2013.6570835","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 International Symposium on Network Coding (NetCod)","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/A5003124189","display_name":"Anna Blasiak","orcid":null},"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":"Anna Blasiak","raw_affiliation_strings":["Cornell University, USA","Cornell University"],"affiliations":[{"raw_affiliation_string":"Cornell University, USA","institution_ids":["https://openalex.org/I205783295"]},{"raw_affiliation_string":"Cornell University","institution_ids":["https://openalex.org/I205783295"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5003124189"],"corresponding_institution_ids":["https://openalex.org/I205783295"],"apc_list":null,"apc_paid":null,"fwci":0.72414375,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.75268817,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"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/T12791","display_name":"Full-Duplex Wireless Communications","score":0.9639000296592712,"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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9581000208854675,"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/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6265647411346436},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.6247159838676453},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5497154593467712},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5379090905189514},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4680720567703247},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.4513874351978302},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.4171893894672394},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.39721208810806274},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.15872791409492493},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.08866330981254578},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.057782918214797974}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6265647411346436},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.6247159838676453},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5497154593467712},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5379090905189514},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4680720567703247},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4513874351978302},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4171893894672394},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.39721208810806274},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.15872791409492493},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.08866330981254578},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.057782918214797974}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/netcod.2013.6570835","is_oa":false,"landing_page_url":"https://doi.org/10.1109/netcod.2013.6570835","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 International Symposium on Network Coding (NetCod)","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":21,"referenced_works":["https://openalex.org/W1509960805","https://openalex.org/W1974018476","https://openalex.org/W1976329386","https://openalex.org/W1986291656","https://openalex.org/W2008362572","https://openalex.org/W2009924457","https://openalex.org/W2044343300","https://openalex.org/W2105831729","https://openalex.org/W2106403318","https://openalex.org/W2121205191","https://openalex.org/W2123562143","https://openalex.org/W2133017912","https://openalex.org/W2137690813","https://openalex.org/W2147101953","https://openalex.org/W2148177011","https://openalex.org/W2150148016","https://openalex.org/W2152986618","https://openalex.org/W2325997012","https://openalex.org/W2544805158","https://openalex.org/W2912745918","https://openalex.org/W6652350263"],"related_works":["https://openalex.org/W1972035260","https://openalex.org/W4301594054","https://openalex.org/W2794488505","https://openalex.org/W3125889879","https://openalex.org/W3124422538","https://openalex.org/W2938514635","https://openalex.org/W2295467472","https://openalex.org/W3046451053","https://openalex.org/W2097909533","https://openalex.org/W4360764540"],"abstract_inverted_index":{"We":[0,62],"introduce":[1],"a":[2,25,34,75],"new":[3],"technique":[4],"to":[5,44,94,98],"certify":[6],"lower":[7,26,102],"bounds":[8],"on":[9,28,38],"the":[10,19,29,40,45,48,58,66,79,82,105,109,122],"multicut":[11,50,80,101],"size":[12,46],"using":[13],"network":[14,20,116],"coding.":[15],"In":[16],"directed":[17],"networks":[18,37],"coding":[21,117],"rate":[22,41,85,120],"is":[23,42,55,86],"not":[24],"bound":[27],"multicut,":[30,111],"but":[31],"we":[32],"identify":[33],"class":[35,54],"of":[36,47,69,108],"which":[39],"equal":[43],"minimum":[49,110],"and":[51,81,112],"show":[52,64],"this":[53,89],"closed":[56],"under":[57],"strong":[59],"graph":[60],"product.":[61],"then":[63],"that":[65,73],"famous":[67],"construction":[68],"Saks":[70],"et":[71],"al.":[72],"gives":[74],"\u0398(k)":[76],"gap":[77],"between":[78],"multicommodity":[83],"flow":[84],"contained":[87],"in":[88],"class.":[90],"This":[91],"allows":[92],"us":[93],"apply":[95],"our":[96],"result":[97],"strengthen":[99],"their":[100],"bound,":[103],"determine":[104],"exact":[106],"value":[107],"give":[113],"an":[114],"optimal":[115],"solution":[118],"with":[119],"matching":[121],"multicut.":[123]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}