In this lecture we will see an example of approximation algorithm based on a very simple technique, the sequential algorithms technique. Then we will see how the well known greedy technique can be used for obtaining approximation algorithms The local search technique, with a simple example of local search algorithm for producing a good solution, and a slight more complicate example for using dynamic programming technique. Finally we will see how a simple algorithms can be obtain by probabilistic algorithm and some examples of approximations classes.

---