演算法設計及分析
出自中山電機所 無線行動網路實驗室
(修訂版本間差異)
第21行: | 第21行: | ||
[http://wmi.ee.nsysu.edu.tw/enter/images/c/cf/2015AlgCh9.pdf Chapter 8. Single-Source Shortest Paths](2015) | [http://wmi.ee.nsysu.edu.tw/enter/images/c/cf/2015AlgCh9.pdf Chapter 8. Single-Source Shortest Paths](2015) | ||
- | [http://wmi.ee.nsysu.edu.tw/enter/images/ | + | [http://wmi.ee.nsysu.edu.tw/enter/images/2/2a/2016Ch8MaxFlow.pdf Chapter 9. Maximum Flow]('''2016/02/24''') |
[http://wmi.ee.nsysu.edu.tw/enter/images/3/3b/2015AlgCh10.pdf Chapter 10. Linear Programming and Its Application to Game Theory](2015) | [http://wmi.ee.nsysu.edu.tw/enter/images/3/3b/2015AlgCh10.pdf Chapter 10. Linear Programming and Its Application to Game Theory](2015) | ||
第33行: | 第33行: | ||
[http://wmi.ee.nsysu.edu.tw/enter/images/b/bc/2012_Appendix_Minimum_Cost_Spanning_Tree.pdf Appendix:Minimum Cost Spanning Tree](自學教材,屬於「資料結構」課程範疇) | [http://wmi.ee.nsysu.edu.tw/enter/images/b/bc/2012_Appendix_Minimum_Cost_Spanning_Tree.pdf Appendix:Minimum Cost Spanning Tree](自學教材,屬於「資料結構」課程範疇) | ||
- | <br> | + | <br> |
<br> | <br> |
在2016年2月24日 (三) 10:44所做的修訂版本
研究所課程, 2016 Spring, Wed 1:10~4:00 PM, F6019
Chapter 1. Introduction(2016/02/24)
Chapter 2. Growth of Functions(2015)
Chapter 3. Divide and Conquer(2015)
Chapter 4. Randomized Algorithms(2016/02/24)
Chapter 4習題解答(更新/2015)
*Derandomization of MAX 3SAT (參考資料)
Chapter 5. Dynamic Programming(2015)
Chapter 6. Greedy Algorithms(2015)
Chapter 7. Strongly Connected Components(2015)
Chapter 8. Single-Source Shortest Paths(2015)
Chapter 9. Maximum Flow(2016/02/24)
Chapter 10. Linear Programming and Its Application to Game Theory(2015)
Chapter 10 投影片資料來源(亦可自己用Google搜尋)
Chapter 11. NP-Completeness(2015)
Chapter 12. Approximation Algorithms(2015)
Appendix:Minimum Cost Spanning Tree(自學教材,屬於「資料結構」課程範疇)