Algorithms for NP-Hard Problems

Combinatorial optimisation problems such as scheduling or optimally playing a board game are often NP-hard. Most of the algorithms in earlier courses run in polynomial time and cannot be directly used for solving NP-hard problems. In this course you will learn some new algorithms, and use these, but also concepts from earlier courses on algorithm design, to solve NP-hard problems.