I know very basics of this.
but still i want to present my idea.
here we go-
1/ find the degree of each of node in U. ( assume if node x of U to
node y of V has k edges still it contribues only 1 to degree
calucaltion).
S = {}
2/ while V is empty {
2a) choose the node k , with max degree in U.
S = S Union {k} ;
U = U minus {k}
V = V minus { those nodes covered by k}
2b) recalculate the degrees of nodes U.
}
3/ S is min cover , we are looking for.