Design of Algorithms

Algorithm design techniques and analysis. Topics include graph algorithms, network flow, string matching, computational geometry, NP-completeness, and approximation algorithms.

算法设计技术与分析，涵盖图算法、网络流、字符串匹配、计算几何、NP完全性和近似算法。

• 1Design algorithms using greedy, divide-and-conquer, and dynamic programming paradigms
• 2Analyse and prove the correctness and complexity of algorithms
• 3Understand NP-completeness and its implications
• 4Apply graph algorithms to model and solve real-world problems