problem Paper
Consider the following problems which are NP (Nondeterministic Polynomial):
– Subset sum problem.
– Minimum spanning tree problem.
With detailed examples show how approximate and heuristic algorithm could be used to solve the above mentioned problems.
No page requirement as long as you cover all the required info above (expected more than 1 page). 12 Times New Roman, Single space. Cite resources if used. This is for a computer science algorithm class.
