演算法設計及分析
出自中山電機所 無線行動網路實驗室
(修訂版本間差異)
第29行: | 第29行: | ||
[http://wmi.ee.nsysu.edu.tw/enter/images/b/b8/Alg2021LinearProgramV5.pdf Chapter 11. Linear Programming and Its Application to Game Theory] | [http://wmi.ee.nsysu.edu.tw/enter/images/b/b8/Alg2021LinearProgramV5.pdf Chapter 11. Linear Programming and Its Application to Game Theory] | ||
- | [http://wmi.ee.nsysu.edu.tw/enter/images/e/ed/LinearProgramming.pdf 註:Chapter 11 | + | [http://wmi.ee.nsysu.edu.tw/enter/images/e/ed/LinearProgramming.pdf 註:Chapter 11 投影片參考資料]<br> |
[http://wmi.ee.nsysu.edu.tw/enter/images/a/a0/Alg2021NPcompleteV2.pdf Chapter 12. NP-Completeness] | [http://wmi.ee.nsysu.edu.tw/enter/images/a/a0/Alg2021NPcompleteV2.pdf Chapter 12. NP-Completeness] |
在2021年10月17日 (日) 05:23所做的修訂版本
研究所課程, 2021 Spring, Thu 2:10~5:00 PM, EC3013
Chapter 2. Growth of Functions
Chapter 4. Randomized Algorithms
*Derandomization of MAX-3SAT (參考資料,自我學習,上課不教,考試不考)
Chapter 5. Dynamic Programming
Chapter 7. Graph Traversal Techniques
Chapter 8. Minimun Cost Spanning Tree
Chapter 10. Maximum Matching
註:Chapter 10 投影片參考資料
Chapter 11. Linear Programming and Its Application to Game Theory
Chapter 13. Approximation Algorithms