Opposite of Job Assignment Problem.

47 Views Asked by At

We have a bipartite graph with two sets $X,Y$.
Size of $X$ = 100000
Size of $Y$ = 25
We have edges from members in $X$ to $Y$.
We need to form set $Z$ by picking minimum number of elements from $Y$ so that each element of $X$ points to atleast one member in $Z$.