演算法設計及分析
出自中山電機所 無線行動網路實驗室
研究所課程, 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/06)
*Reference. Chapter 11 投影片資料來源(有興趣的同學自己閱讀)
Chapter 12. NP-Completeness(2012/01/05)
Chapter 13. Approximation Algorithms(2012/01/02)
Appendix:Minimum Cost Spanning Tree(自修教材,屬於「資料結構」課程範疇)