@article{4f28fe2d593a401fb552fd6082e0fef9,
title = "A bound on the shannon capacity via a linear programming variation",
abstract = "We prove an upper bound on the Shannon capacity of a graph via a linear programming variation. We show that our bound can outperform both the Lov\'asz theta number and the Haemers minimum rank bound. As a by-product, we also obtain a new upper bound on the broadcast rate of index coding.",
keywords = "Index coding, Linear programming, Shannon capacity",
author = "Sihuang Hu and Itzhak Tamo and Ofer Shayevitz",
note = "Publisher Copyright: {\textcopyright} 2018 Society for Industrial and Applied Mathematics.",
year = "2018",
doi = "10.1137/17M115565X",
language = "אנגלית",
volume = "32",
pages = "2229--2241",
journal = "SIAM Journal on Discrete Mathematics",
issn = "0895-4801",
publisher = "Society for Industrial and Applied Mathematics (SIAM)",
number = "3",
}