Back to Search
Start Over
A BOUND ON THE SHANNON CAPACITY VIA A LINEAR PROGRAMMING VARIATION.
- Source :
-
SIAM Journal on Discrete Mathematics . 2018, Vol. 32 Issue 3, p2229-2241. 13p. - Publication Year :
- 2018
-
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. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 08954801
- Volume :
- 32
- Issue :
- 3
- Database :
- Academic Search Index
- Journal :
- SIAM Journal on Discrete Mathematics
- Publication Type :
- Academic Journal
- Accession number :
- 132351606
- Full Text :
- https://doi.org/10.1137/17M115565X