Question: 1. [10 marks] Recall that in a graph G (V, E) a set U C V is an independent set iff V-U is a vertex

 1. [10 marks] Recall that in a graph G (V, E)

1. [10 marks] Recall that in a graph G (V, E) a set U C V is an independent set iff V-U is a vertex cover. Also, U is an independent set in G iff U is a clique in the complement of G. These relationships provide polynomial time reductions among these three NP-complete problems The point of this question is to ask whether these reductions preserve good approximations. (a) [5 marks] Does a polynomial time constant factor approximation algorithm for the Inde- pendent Set Problem give a polynomial time constant factor approximation algorithm or the Clique Problem? Explain (b) 5 marks] Does a polynomial time constant factor approximation algorithm for the Inde- pendent Set Problem give a polynomial time constant factor approximation algorithnm for the Vertex Cover Problem? Explain

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!