Problem 1 (20 points). Vertex cover and clique are complementary problems. (A vertex cover V’ in G corresponds to a clique V – V in Gc, the complement graph of G.) Does this relationship imply that there exists a polynomial time approximation algorithm for clique with a constant approximation ratio? Why or why not? Show transcribed image text Problem 1 (20 points). Vertex cover and clique are complementary problems. (A vertex cover V’ in G
OR
OR