Jan 21, 2009 · We consider the problems of finding a maximum clique in a graph and finding a maximum-edge biclique in a bipartite graph. Both problems are NP-hard.
Recent work by Recht, Fazel, Parrilo and others suggests that nuclear norm is a good relaxation for rank minimization. Nuclear norm relaxation of biclique: (NNR).
May 18, 2011 · We consider the problems of finding a maximum clique in a graph and finding a maximum-edge biclique in a bipartite graph.
Jan 21, 2009 · Abstract. We consider the problems of finding a maximum clique in a graph and finding a maximum-edge biclique in a bipartite graph.
Jan 21, 2009 · Abstract. We consider the problems of finding a maximum clique in a graph and finding a maximum-edge biclique in a bipartite graph.
Nuclear norm minimization for the planted clique and biclique problems
search.proquest.com › openview
We write both problems as matrix-rank minimization and then relax them using the nuclear norm. This technique, which may be regarded as a generalization of ...
Ames, B. , & Vavasis, S. . (2011). Nuclear norm minimization for the planted clique and biclique problems. Mathematical Programming, 129, 69-89.
Mar 31, 2012 · The authors recast the biclique problem to a rank minimization, subject to affine constraints. Then, they solve a relaxation using a nuclear ...
Apr 29, 2010 · Maximum clique and maximum biclique problems, both of which are. NP-hard, can be solved in polynomial time using nuclear norm minimization, ...
Nuclear norm minimization can be rewritten as semidefinite programming. Page 9. Convex relaxation and randomized problems. Clique, biclique and rank ...