演算法設計及分析
出自中山電機所 無線行動網路實驗室
(修訂版本間差異)
(→研究所課程, 2011 Spring, Tue 9:00~12:00 AM, F3009) |
|||
第21行: | 第21行: | ||
[http://wmi.ee.nsysu.edu.tw/enter/images/d/d3/2012_Lecture_10_Maximum_Flow.pdf Chapter 10. Maximum Flow](2012/01/02) | [http://wmi.ee.nsysu.edu.tw/enter/images/d/d3/2012_Lecture_10_Maximum_Flow.pdf Chapter 10. Maximum Flow](2012/01/02) | ||
- | [http://wmi.ee.nsysu.edu.tw/enter/images/3/31/2012_Lecture_11_Linear_Programming_and_Game_TheoryV3.pdf Chapter 11. Linear Programming and Game Theory](2012/01/ | + | [http://wmi.ee.nsysu.edu.tw/enter/images/3/31/2012_Lecture_11_Linear_Programming_and_Game_TheoryV3.pdf Chapter 11. Linear Programming and Game Theory](2012/01/05) |
- | [http://wmi.ee.nsysu.edu.tw/enter/images/3/3d/2012_Lecture_12_NP-Completeness.pdf Chapter 12. NP-Completeness](2012/01/ | + | [http://wmi.ee.nsysu.edu.tw/enter/images/3/3d/2012_Lecture_12_NP-Completeness.pdf Chapter 12. NP-Completeness](2012/01/05) |
[http://wmi.ee.nsysu.edu.tw/enter/images/9/94/2012_Lecture_13_Approximation_Algorithms.pdf Chapter 13. Approximation Algorithms](2012/01/02)<br> | [http://wmi.ee.nsysu.edu.tw/enter/images/9/94/2012_Lecture_13_Approximation_Algorithms.pdf Chapter 13. Approximation Algorithms](2012/01/02)<br> | ||
[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](自修教材,屬於「資料結構」課程範疇) |
在2012年1月5日 (四) 02:18所做的修訂版本
研究所課程, 2011 Spring, Tue 9:00~12:00 AM, F3009
Chapter 1. Introduction(2012/01/02)
Chapter 2. Growth of Functions(2012/01/02)
Chapter 3. Divide and Conquer(2012/01/02)
Chapter 4. Selection(2012/01/02)
Chapter 5. Randomized Algorithms(2012/01/02)
Chapter 6. Dynamic Programming(2012/01/02)
Chapter 7. Greedy Algorithms(2012/01/02)
Chapter 8. Strongly Connected Components(2012/01/02)
Chapter 9. Single-Source Shortest Paths(2012/01/02)
Chapter 10. Maximum Flow(2012/01/02)
Chapter 11. Linear Programming and Game Theory(2012/01/05)
Chapter 12. NP-Completeness(2012/01/05)
Chapter 13. Approximation Algorithms(2012/01/02)
Appendix:Minimum Cost Spanning Tree(自修教材,屬於「資料結構」課程範疇)