{"id":"https://openalex.org/W2964060591","doi":"https://doi.org/10.1109/isit.2017.8006691","title":"A bound on the shannon capacity via a linear programming variation","display_name":"A bound on the shannon capacity via a linear programming variation","publication_year":2017,"publication_date":"2017-06-01","ids":{"openalex":"https://openalex.org/W2964060591","doi":"https://doi.org/10.1109/isit.2017.8006691","mag":"2964060591"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2017.8006691","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2017.8006691","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE International Symposium on Information Theory (ISIT)","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/A5007240524","display_name":"Sihuang Hu","orcid":"https://orcid.org/0000-0002-2910-3025"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Sihuang Hu","raw_affiliation_strings":["Tel Aviv University"],"affiliations":[{"raw_affiliation_string":"Tel Aviv University","institution_ids":["https://openalex.org/I16391192"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5085150941","display_name":"Itzhak Tamo","orcid":"https://orcid.org/0000-0002-8000-0419"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Itzhak Tamo","raw_affiliation_strings":["Tel Aviv University"],"affiliations":[{"raw_affiliation_string":"Tel Aviv University","institution_ids":["https://openalex.org/I16391192"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5032708627","display_name":"Ofer Shayevitz","orcid":"https://orcid.org/0000-0003-4321-0318"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Ofer Shayevitz","raw_affiliation_strings":["Tel Aviv University"],"affiliations":[{"raw_affiliation_string":"Tel Aviv University","institution_ids":["https://openalex.org/I16391192"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5007240524"],"corresponding_institution_ids":["https://openalex.org/I16391192"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.35548842,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"i","issue":null,"first_page":"1063","last_page":"1066"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11476","display_name":"Graph theory and applications","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9994000196456909,"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/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.7776653170585632},{"id":"https://openalex.org/keywords/variation","display_name":"Variation (astronomy)","score":0.7427066564559937},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.7014117240905762},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5193061232566833},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.5087299942970276},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.43365633487701416},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.40117108821868896},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3917185664176941},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.23121052980422974}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.7776653170585632},{"id":"https://openalex.org/C2778334786","wikidata":"https://www.wikidata.org/wiki/Q1586270","display_name":"Variation (astronomy)","level":2,"score":0.7427066564559937},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.7014117240905762},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5193061232566833},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.5087299942970276},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.43365633487701416},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.40117108821868896},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3917185664176941},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.23121052980422974},{"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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C44870925","wikidata":"https://www.wikidata.org/wiki/Q37547","display_name":"Astrophysics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/isit.2017.8006691","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2017.8006691","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},{"id":"pmh:oai:publications.rwth-aachen.de:752033","is_oa":false,"landing_page_url":"https://publications.rwth-aachen.de/search?p=id:%22RWTH-2018-231824%22","pdf_url":null,"source":{"id":"https://openalex.org/S4306401033","display_name":"RWTH Publications (RWTH Aachen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887968799","host_organization_name":"RWTH Aachen University","host_organization_lineage":["https://openalex.org/I887968799"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM journal on discrete mathematics 32(3), 2229-2241 (2018). doi:10.1137/17M115565X","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","score":0.4399999976158142,"id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W2038488239","https://openalex.org/W2044716089","https://openalex.org/W2078289947","https://openalex.org/W2164684058"],"related_works":["https://openalex.org/W2386430105","https://openalex.org/W2356521405","https://openalex.org/W2038534795","https://openalex.org/W2384358604","https://openalex.org/W1567829292","https://openalex.org/W3001063351","https://openalex.org/W3196905815","https://openalex.org/W2351370765","https://openalex.org/W3133811809","https://openalex.org/W1967452726"],"abstract_inverted_index":{"We":[0,17],"prove":[1],"an":[2],"upper":[3],"bound":[4,22],"on":[5],"the":[6],"Shannon":[7],"capacity":[8],"of":[9],"a":[10,13],"graph":[11],"via":[12],"linear":[14],"programming":[15],"variation.":[16],"also":[18],"show":[19],"that":[20],"our":[21],"can":[23],"be":[24],"better":[25],"than":[26],"Lov\u00e1sz":[27],"theta":[28],"number":[29],"and":[30],"Haemers":[31],"minimum":[32],"rank":[33],"bound.":[34]},"counts_by_year":[],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}