Greedy algorithms are algorithms designed using an intuitive rule of thumb, which can be proven to lead to optimal solutions. In these lectures, several examples of problems and such algorithms are given to illustrate this general concept. In addition, quite some time is spent on the proving techniques required to show the correctness and optimality of the presented algorithms.

Back to top