演算法設計及分析
出自中山電機所 無線行動網路實驗室
（修訂版本間差異）
| 第23行： | 第23行： | ||
'''期中考 (2019/04/25)''' | '''期中考 (2019/04/25)''' | ||
| - | Chapter 8. Minimun Cost Spanning Tree <br> | + | Chapter 8. Minimun Cost Spanning Tree <br> |
Chapter 9. Maximum Flow | Chapter 9. Maximum Flow | ||
| - | + | Chapter 10. Linear Programming and Its Application to Game Theory | |
[http://wmi.ee.nsysu.edu.tw/enter/images/e/ed/LinearProgramming.pdf 註1：Chapter 10 投影片資料來源] | [http://wmi.ee.nsysu.edu.tw/enter/images/e/ed/LinearProgramming.pdf 註1：Chapter 10 投影片資料來源] | ||
| 第33行： | 第33行： | ||
[http://www.cs.columbia.edu/coms6998-3/lpprimer.pdf 註2：Relations between a primary problem and its dual problem] | [http://www.cs.columbia.edu/coms6998-3/lpprimer.pdf 註2：Relations between a primary problem and its dual problem] | ||
| - | + | Chapter 11. NP-Completeness | |
| - | + | Chapter 12. Approximation Algorithms<br> | |
<br> | <br> | ||
<br> | <br> | ||
在2020年3月4日 (三) 01:46所做的修訂版本
研究所課程, 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
註2：Relations between a primary problem and its dual problem
Chapter 11. NP-Completeness
Chapter 12. Approximation Algorithms
