Bipartite sandwiches: Semidefinite relaxations for maximum biclique

zbMATH Open1072.05578MaRDI QIDQ2741360FDOQ2741360

Dmitrii V. Pasechnik

Publication date: 23 September 2001

Full work available at URL: http://www.elsevier.nl/cas/tree/store/disc/free/endm/store/contents.htt?jrnl=disc&sctn=endm&mode=sub&vol=3

zbMATH Keywords

approximationbipartite graphmaximum bicliqueLovász theta function

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Semidefinite programming (90C22)

Cited In (4)

• Finding biclusters by random projections
• A notion of cross-perfect bipartite graphs
• Bicliques and eigenvalues
• The maximum edge biclique problem is NP-complete

   Recommendations

• On semidefinite programming relaxations of maximum \(k\)-section 👍 👎
• Connection between semidefinite relaxations of the max-cut and stable set problems 👍 👎
• k-Clustering Minimum Biclique Completion via a Hybrid CP and SDP Approach 👍 👎
• Title not available (Why is that?) 👍 👎
• Unifying semidefinite and set-copositive relaxations of binary problems and randomization techniques 👍 👎

This page was built for publication: Bipartite sandwiches: Semidefinite relaxations for maximum biclique

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2741360)