Share Description
In this course, you will learn:
- The problem of NP-completeness and how to solve it.
- What is the best way to approximate algorithms?
- When traditional approaches are too sluggish, how to employ heuristic algorithms to solve an issue faster.
Syllabus:
- NP-Complete Problems
- Coping with NP-completeness: special cases
- Coping with NP-completeness: exact and approximate algorithms
