Inapproximability of Maximum Weighted Edge Biclique and Its Applications

Abstract

Given a bipartite graph G = (V ₁,V ₂,E) where edges take on both positive and negative weights from set $\mathcal{S}$, the maximum weighted edge biclique problem, or $\mathcal{S}$-MWEB for short, asks to find a bipartite subgraph whose sum of edge weights is maximized. This problem has various applications in bioinformatics, machine learning and databases and its (in)approximability remains open. In this paper, we show that for a wide range of choices of $\mathcal{S}$, specifically when $\left| \frac{\min\mathcal{S}} {\max \mathcal{S}} \right| \in \Omega(\eta^{\delta-1/2}) \cap O(\eta^{1/2-\delta})$ (where η =  max {|V ₁|, |V ₂|}, and δ ∈ (0,1/2]), no polynomial time algorithm can approximate $\mathcal{S}$-MWEB within a factor of n ^ε for some ε> 0 unless RP =  NP. This hardness result gives justification of the heuristic approaches adopted for various applied problems in the aforementioned areas, and indicates that good approximation algorithms are unlikely to exist. Specifically, we give two applications by showing that: 1) finding statistically significant biclusters in the SAMBA model, proposed in [18] for the analysis of microarray data, is n ^ε-inapproximable; and 2) no polynomial time algorithm exists for the Minimum Description Length with Holes problem [4] unless RP = NP.