Bicovering: Covering edges with two small subsets of vertices.

We study the following basic problem called BI-COVERING. Given a graph G(V, E), find two (not necessarily disjoint) sets A subset of V and B subset of V such that A boolean OR B = V and such that every edge e belongs to either the graph induced by A or the graph induced by B. The goal is to minimize max{vertical bar A vertical bar,vertical bar B vertical bar}. This is the most simple case of the Channel Allocation problem [R. Gandhi et al., Networks, 47 (2006), pp. 225-236]. A solution that outputs V, 0 gives ratio at most 2. We show that under a similar strong Unique Games Conjecture by Bansal and Khot [Optimal long code test with one free bit, in Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, FOCS'09, IEEE, 2009, pp. 453-462] there is no 2 ratio algorithm for the problem, for any constant is an element of> 0. Given a bipartite graph, MAx-BI-CLIQUE is a problem of finding the largest k x k complete bipartite subgraph. For the MAx-BI-CLIQUE problem, a constant factor hardness was known under a random 3-SAT hypothesis of Feige [Relations between average case complexity and approximation complexity, in Proceedings of the 34th Annual ACM Symposium on Theory of Computing, ACM, 2002, pp. 534-543] and also under the assumption that NP not subset of boolean AND c>0DTIME(2N(is an element of))[S. Khot, SIAM J. Comput., 36 (2006), pp. 1025-1071]. It was an open problem in [C. Ambuhl, M. Mastrolilli, and 0. Svensson, SIAM J. Comput., 40 (2011), pp. 567-596] to prove inapproximability of MAx-BI-CLIQUE assuming weaker conjecture. Our result implies a similar hardness result assuming the Strong Unique Games Conjecture. On the algorithmic side, we also give better than 2 approximation for BI-COVERING on numerous special graph classes. In particular, we get 1.876 approximation for chordal graphs, an exact algorithm for interval graphs, 1 + 0(1) for minor free graphs, 2-4 delta/3 for graphs with minimum degree delta n, 2/(1 + delta(2)/8) for delta-vertex expander, 8/5 for split graphs, 2 (6/5) . 1/d for graphs with minimum constant degree d, etc. Our algorithmic results are quite nontrivial. In achieving these results, we use various known structural results about the graphs combined with the techniques that we develop tailored to getting better than 2 approximation.