演算法設計及分析
出自中山電機所 無線行動網路實驗室
(修訂版本間差異)
第29行: | 第29行: | ||
[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 投影片資料來源] | ||
- | [http://www.cs.columbia.edu/coms6998-3/lpprimer.pdf 註2:Relations between a | + | [http://www.cs.columbia.edu/coms6998-3/lpprimer.pdf 註2:Relations between a primal problem and its dual problem] |
[http://wmi.ee.nsysu.edu.tw/enter/images/2/2b/Alg20Ch11NPcomplete.pdf Chapter 11. NP-Completeness] | [http://wmi.ee.nsysu.edu.tw/enter/images/2/2b/Alg20Ch11NPcomplete.pdf Chapter 11. NP-Completeness] |
在2020年3月6日 (五) 08:35所做的修訂版本
研究所課程, 2019 Spring, Thu 2:10~5:00 PM, EC3009
已經可以下載
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. Linear Programming and Its Application to Game Theory
註2:Relations between a primal problem and its dual problem
Chapter 12. Approximation Algorithms