advanced algorithms unit 5 material
syllabus for this unit
UNIT - V
NP-Completeness and Approximation Algorithms: Polynomial-time, polynomial-time verification, NP-Completeness and reducibility, NP-Complete problems. Approximation Algorithms- Vertex cover Problem, Travelling Salesperson problem. (Chapter - 8)
To download this material... please download it from the below link
credits - Technical publications.
No comments:
Post a Comment