Fall 2020 — 40974 Computer Science 2

This course is an introduction to algorithm design. Topics will include divide-and-conquer, greedy, and dynamic programming approaches to the design of algorithms for string processing problems, network optimization problems, and problems about cuts, flows and matchings in graphs. We will also cover linear programming and NP-completeness.

General information

Instructor: Luca Trevisan

More information will be posted by mid-August, 2020.