I have a bigraph with sets $L$ and $R$. I want to find bicliques such that all elements in $L$ are in some special subset $k$ while minimizing the number of elements in $R$. 
Special Biclique Problem
graph theory;sets