Question: Approximation algorithm Check (circle) whichever applied to maximum independent set in graphs: a. NP-complete b. Solvable exactly in pt (polynomial time) c. Approximable in pt

Approximation algorithm  Approximation algorithm Check (circle) whichever applied to maximum independent set in

Check (circle) whichever applied to maximum independent set in graphs: a. NP-complete b. Solvable exactly in pt (polynomial time) c. Approximable in pt within factor 2.9999 d. Approximable in pt within factor 1.9999 e. Approximable in pt within factor 1.4999 Check whichever applied to the traveling salesperson problem: a. NP-complete b. Solvable exactly in pt (polynomial time) c. Approximable in pt within factor 2.9999 Approximable in pt within factor 1.9999 e. Approximable in pt within factor 1.4999 Check whichever applied to the vertex cover problem (assuming P notequalto NP): a. NP-complete b. Solvable exactly in pt (polynomial time) b. Approximable in pt within factor 2.9999 d. Approximable in pt within factor 1.9999 e. Approximable in pt within factor 2.0001

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!