Problem 3 Greedy Vc Given Graph G Vertex Cover Subset C Vertices Touching Edges G Would Li Q37043771

Problem 3. Greedy VC. Given a graph G, a vertex cover is a subset C of vertices, touching all the edges of G. We would like to find a vertex cover of minimum size. However, the exact minimum is “NP-hard” to find, so we consider this fast greedy approach instead: GreedyVC(G): while G has edges: pick a vertex v in G with maximum degree add v to C remove all

OR

 

OR