Question: a . Why are optimization problems NP - hard, but not NP - complete even though they can solve NP - complete problems? e .

a. Why are optimization problems NP-hard, but not NP-complete even though they can solve NP-complete problems? e.g, why is Vertex Cover NP-complete, but Minimum Vertex Cover is not?

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 Programming Questions!