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 NPhard, but not NPcomplete even though they can solve NPcomplete problems? eg why is Vertex Cover NPcomplete, but Minimum Vertex Cover is not?
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
