Abstract
SUMMARY For a graph G, a biclique edge partition SBP(G) is a collection of bicliques (complete bipartite subgraphs) Bi such that each edge of G is contained in exactly one Bi. The Minimum Biclique Edge Partition Problem (MBEPP) asks for SBP(G) with the minimum size. In this paper, we show that for arbitrary small �> 0, (6053/6052 − � )-approximation of MBEPP is NP-hard.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have