演算法設計及分析
出自中山電機所 無線行動網路實驗室
(修訂版本間差異)
第10行: | 第10行: | ||
[http://wmi.ee.nsysu.edu.tw/enter/images/e/ef/Alg2021RandomizedAlg.pdf Chapter 4. Randomized Algorithms] | [http://wmi.ee.nsysu.edu.tw/enter/images/e/ef/Alg2021RandomizedAlg.pdf 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 習題解答] | ||
第22行: | 第18行: | ||
[http://wmi.ee.nsysu.edu.tw/enter/images/0/01/Alg2021GreedyV2.pdf Chapter 6. Greedy Algorithms] <br> | [http://wmi.ee.nsysu.edu.tw/enter/images/0/01/Alg2021GreedyV2.pdf Chapter 6. Greedy Algorithms] <br> | ||
+ | |||
+ | '''更新日期 2021/04/08''' | ||
+ | |||
+ | |||
[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> | ||
- | [http://wmi.ee.nsysu.edu.tw/enter/images/9/99/Alg2021MimSpanningTree.pdf 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> |
[http://wmi.ee.nsysu.edu.tw/enter/images/2/2b/Alg2021MaxFlow.pdf Chapter 9. Maximum Flow] | [http://wmi.ee.nsysu.edu.tw/enter/images/2/2b/Alg2021MaxFlow.pdf Chapter 9. Maximum Flow] |
在2021年4月8日 (四) 07:56所做的修訂版本
研究所課程, 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
更新日期 2021/04/08
Chapter 7. Graph Traversal Techniques
Chapter 8. Minimun Cost Spanning Tree (預計上課不教,考試不考)
Chapter 11. Linear Programming and Its Application to Game Theory
Chapter 13. Approximation Algorithms