演算法設計及分析
出自中山電機所 無線行動網路實驗室
研究所課程, 2019 Spring, Thu 2:10~5:00 PM, EC3009
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. Graph Traversal Techniques
期中考 (2019/04/25)
Chapter 8. Minimun Cost Spanning Tree
Chapter 9. Maximum Flow
Chapter 10. Linear Programming and Its Application to Game Theory （5/30 更新第 61, 62 頁：筆誤的部分）
註2：Relations between a primary problem and its dual problem
Chapter 12. Approximation Algorithms
