Engineering in Computer Science and Artificial Intelligence

The objective of the course is introduce the fundamental concepts of algorithms design for polynomial time and hard computational problems. The course will present the basic concepts of algorithm design for network flow and matching problems. General techniques such as greedy and dynamic programming will be applied to problems like shortest paths, spanning tree, knapsack, scheduling. Approximation algorithms will be presented for hard computational problems like TSP, vertex cover, set cover, sat, scheduling. Special emphasis will be given to methods based on Linear Programming and randomized algorithms. Finally, the course will introduce the major computational problems in game theory.