Design and Analysis of Algorithms
Biaoshuai Tao, Assistant Professor (tenure-track)
John Hopcroft Center for Computer Science
Shanghai Jiao Tong University
This course will cover the basic approaches and mindsets for analyzing and designing algorithms. Topics include the following: divide and conquer, basic graph algorithms, greedy algorithms, dynamic programming, network flow, NP-hardness. Possible additional topics: approximation algorithms, hardness of approximation.