Abstract

We prove that the Maximum Balanced Complete Bipartite Subgraph (BCBS) problem is (log n)δ hard to approximate within � a factor of 2 for some δ>0 under the plausible assumption that 3-SAT � ∈ DTIME 2n3/4+ɛ � for some ɛ>0. WealsoshowthatitisNP-hard to approximate the BCBS problem within a constant factor under the assumption that it is NP-hard to approximate the maximum clique problem within a factor of n/2c√lg n for some small enough c>0. Furthermore we show that the same hardness of approximation results holds for the Maximum Edge Biclique problem. 1 Introduction and

Citations