Give a polynomial-time algorithm that finds _V/2_ vertices that collectively cover at least three-fourths (3/4) of the edges in an arbitrary undirected graph.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.