The MAX-LABEL-COVER(K,L) Problem: An instance to the MAX-LABEL-COVER(K,L) problem comprises of a bipartite graph G(U, V, E) with U and V being the two partitions, and a projection function πv→u : L → K on each edge (u, v). The objective is to obtain a labeling of the vertices (a function f : U → K, V → L) which satisfies maximum fraction of the edges. Edge (u, v) is satisfied by labeling f if a...