Bipartite sandwiches: semide?nite relaxations for maximum biclique
- 31 May 1999
- journal article
- Published by Elsevier in Electronic Notes in Discrete Mathematics
- Vol. 3, 157-161
- https://doi.org/10.1016/s1571-0653(05)80046-0
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Approximating Clique and Biclique ProblemsJournal of Algorithms, 1998
- The Lovász Theta Function and a Semidefinite Programming Relaxation of Vertex CoverSIAM Journal on Discrete Mathematics, 1998
- Semidefinite programming in combinatorial optimizationMathematical Programming, 1997
- Disconnected Vertex Sets and Equidistant Code PairsThe Electronic Journal of Combinatorics, 1997
- The Sandwich TheoremThe Electronic Journal of Combinatorics, 1994
- A comparison of the Delsarte and Lovász boundsIEEE Transactions on Information Theory, 1979
- On the Shannon capacity of a graphIEEE Transactions on Information Theory, 1979