演算法設計及分析
出自中山電機所 無線行動網路實驗室
(修訂版本間差異)
(→研究所課程, 2011 Spring, Tue 9:00~12:00 AM, F3009) |
(→研究所課程, 2011 Spring, Tue 9:00~12:00 AM, F3009) |
||
第19行: | 第19行: | ||
[http://wmi.ee.nsysu.edu.tw/enter/images/2/2c/2012_Lecture_9_Single-Source_Shortest_PathsV2.pdf Chapter 9. Single-Source Shortest Paths]('''2012/05/02''') | [http://wmi.ee.nsysu.edu.tw/enter/images/2/2c/2012_Lecture_9_Single-Source_Shortest_PathsV2.pdf Chapter 9. Single-Source Shortest Paths]('''2012/05/02''') | ||
- | [http://wmi.ee.nsysu.edu.tw/enter/images/ | + | [http://wmi.ee.nsysu.edu.tw/enter/images/e/e4/2012_Lecture_10_Maximum_FlowV2.pdf Chapter 10. Maximum Flow](2012/05/11) |
[http://wmi.ee.nsysu.edu.tw/enter/images/e/e9/2012_Lecture_11_Linear_Programming_and_Game_TheoryV10.pdf Chapter 11. Linear Programming and Its Application to Game Theory](2012/01/09) | [http://wmi.ee.nsysu.edu.tw/enter/images/e/e9/2012_Lecture_11_Linear_Programming_and_Game_TheoryV10.pdf Chapter 11. Linear Programming and Its Application to Game Theory](2012/01/09) |
在2012年5月11日 (五) 04:21所做的修訂版本
研究所課程, 2011 Spring, Tue 9:00~12:00 AM, F3009
Chapter 1. Introduction(2012/02/22)
Chapter 2. Growth of Functions(2012/02/29。注意:改了最後的自我評量部分)
Chapter 3. Divide and Conquer(2012/01/02)
Chapter 4. Selection(2012/01/02)
Chapter 5. Randomized Algorithms(2012/01/20)
Chapter 6. Dynamic Programming(2012/03/28)
Chapter 7. Greedy Algorithms(2012/04/11)
Chapter 8. Strongly Connected Components(2012/04/25)
Chapter 9. Single-Source Shortest Paths(2012/05/02)
Chapter 10. Maximum Flow(2012/05/11)
Chapter 11. Linear Programming and Its Application to Game Theory(2012/01/09)
*Reference. Chapter 11 投影片資料來源(有興趣的同學自己閱讀)
Chapter 12. NP-Completeness(2012/01/05)
Chapter 13. Approximation Algorithms(2012/01/02)
Appendix:Minimum Cost Spanning Tree(自修教材,屬於「資料結構」課程範疇)