| Homework 9DetailsDo the following problems from the Algorithms textbook:
- Exercise 8.2. Hint: You will probably run the Rudrata path algorithm
multiple times in order to find the path. But what is going to be different about each time you run it? Be sure to give a complete and clear description of your algorithm and justify the fact that it is polynomial-time.
- Exercise 8.10. Do any five of them. Clearly indicate which ones you are doing! Be clear about how the problem is a generalization of another NP-Complete problem.
- Exercise 8.18. Do not over think this one, but do give enough details to make it clear.
|