演算法設計及分析
出自中山電機所 無線行動網路實驗室
研究所課程, 2019 Spring, Thu, 2:10~5:00 PM, F3009
Chapter 2. Growth of Functions
Chapter 3. Divide and Conquer
Chapter 4. Randomized Algorithms
*Derandomization of MAX-3SAT （參考資料，自我學習，上課不教，考試不考）
Chapter 5. Dynamic Programming
Chapter 6. Greedy Algorithms
Chapter 7. Strongly Connected Components
Chapter 8. Minimun Cost Spanning Tree
Chapter 9. Maximum Flow
Chapter 10. Linear Programming and Its Application to Game Theory
Chapter 11. NP-Completeness
Chapter 12. Approximation Algorithms
