1) Name two NP problems for which we have goodapproximate solution algorithms.
2) Name two NP problems for which we do not have goodapproximate solution algorithms.
3) Why is it important to find a P solution to just oneof the NP-complete problems?
Answer
Answer 1:
There are numerous kinds of NP-hard optimization issues. Some ofthem are ridiculously hard, as we can demonstrate thatthere is no estimate algorithm superior to somethreshold.
Then again, there is a considerable amount of NP-hardissues that have a Polynomial-time estimate plot: the additionaltime you have, the better outcomes you can get. Parameterizedintricacy is another decent perspective: numerous problems end upbeing
OR
OR