演算法設計及分析
出自中山電機所 無線行動網路實驗室
(修訂版本間差異)
第19行: | 第19行: | ||
[http://wmi.ee.nsysu.edu.tw/enter/images/5/56/Alg2021SCC.pdf Chapter 7. Graph Traversal Techniques]<br> | [http://wmi.ee.nsysu.edu.tw/enter/images/5/56/Alg2021SCC.pdf Chapter 7. Graph Traversal Techniques]<br> | ||
- | Chapter 8. Minimun Cost Spanning Tree <br> | + | [http://wmi.ee.nsysu.edu.tw/enter/images/9/99/Alg2021MimSpanningTree.pdf Chapter 8. Minimun Cost Spanning Tree ]<br> |
Chapter 9. Maximum Flow | Chapter 9. Maximum Flow |
在2021年2月26日 (五) 07:48所做的修訂版本
研究所課程, 2021 Spring, Thu 2:10~5:00 PM, EC3013
Chapter 0. 學期成績計分方式
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 9. Maximum Flow
Chapter 10. Maximum Matching
Chapter 11. Linear Programming and Its Application to Game Theory
註2:Relations between a primal problem and its dual problem
Chapter 12. NP-Completeness
Chapter 13. Approximation Algorithms