Search for contacts, projects,
courses and publications

Algorithms & Complexity

People

Papadopoulou E.

Course director

Prorokovic K.

Assistant

Wang Z.

Assistant

Description

The course contents include graph traversals, greedy algorithms, divide and conquer algorithms, dynamic programming, network flow, bipartite matching, circulation, NP completeness and computational intractability, approximation algorithms. Techniques on algorithm design and analysis will be developed by drawing on problems from across many areas of computer science and related fields.

Teaching mode

In presence