演算法設計及分析
出自中山電機所 無線行動網路實驗室
(修訂版本間差異)
第5行: | 第5行: | ||
[http://wmi.ee.nsysu.edu.tw/enter/images/8/87/Alg20Ch1Introduction.pdf Chapter 1. Introduction] | [http://wmi.ee.nsysu.edu.tw/enter/images/8/87/Alg20Ch1Introduction.pdf Chapter 1. Introduction] | ||
- | + | Chapter 2. Growth of Functions | |
- | + | Chapter 3. Divide and Conquer | |
- | + | Chapter 4. Randomized Algorithms | |
[http://wmi.ee.nsysu.edu.tw/enter/images/9/93/RandAlgChapSol2.pdf Chapter 4 習題解答] | [http://wmi.ee.nsysu.edu.tw/enter/images/9/93/RandAlgChapSol2.pdf Chapter 4 習題解答] | ||
第15行: | 第15行: | ||
[http://www.cs.toronto.edu/~bor/373f05/max3sat.pdf *Derandomization of MAX-3SAT] (參考資料,自我學習,上課不教,考試不考) | [http://www.cs.toronto.edu/~bor/373f05/max3sat.pdf *Derandomization of MAX-3SAT] (參考資料,自我學習,上課不教,考試不考) | ||
- | + | Chapter 5. Dynamic Programming | |
- | + | Chapter 6. Greedy Algorithms <br> | |
- | + | Chapter 7. Graph Traversal Techniques<br> | |
'''期中考 (2019/04/25)''' | '''期中考 (2019/04/25)''' | ||
- | + | Chapter 8. Minimun Cost Spanning Tree <br> | |
- | + | Chapter 9. Maximum Flow | |
[http://wmi.ee.nsysu.edu.tw/enter/images/7/73/AlgCh10SimplexV2.pdf Chapter 10. Linear Programming and Its Application to Game Theory] '''(5/30 更新第 61, 62 頁:筆誤的部分)''' | [http://wmi.ee.nsysu.edu.tw/enter/images/7/73/AlgCh10SimplexV2.pdf Chapter 10. Linear Programming and Its Application to Game Theory] '''(5/30 更新第 61, 62 頁:筆誤的部分)''' |
在2020年3月3日 (二) 22:48所做的修訂版本
研究所課程, 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