|Algorithms and Complexity|
|Title: ||Algorithms and Complexity|
|Lesson Code: ||321-4201|
|Theory Hours: ||4|
|Lab Hours: ||2|
|Faculty: ||Kaporis Alexios|
Combinatorial optimization problems. Divide-conquer algorithms. FFT. Dynamic programming. Greedy algorithms. Graph algorithms. Minimal spanning trees & algorithms. Maximum flow. Randomized algorithms. Approximation algorithms.
Knowledge of the most important algorithms of the theory of computation and experimental validation of their performance.
1. Algorithm Design, Jon Kleinberg, Eva Tardos.
2. Algorithms, Sanjou Dasgupta, Christos Papadimitriou, Umesh Vazirani.
3. Introduction to Algorithms by Cormen , Leiserson, Rivest and Stein.
|Learning Activities and Teaching Methods |
Lectures with slides. Use of optimization software as maple. The lectures are written in videos to help the understanding. Experimental validation of all algorithms in the lab areas.
|Assessment/Grading Methods |
||125 hours (5 ECTS)
|Language of Instruction|
|Greek, English (for Erasmus students)|
|Μode of delivery |