演算法設計及分析
出自中山電機所 無線行動網路實驗室
研究所課程, 2014 Spring, Wed 1:10~4:00 PM, F3010
2015 投影片教材懶人包(製作中)
Chapter 1. Introduction(2014)
Chapter 2. Growth of Functions(2014)
Chapter 3. Divide and Conquer(2014)
Chapter 4. Randomized Algorithms(2014)
Chapter 5. Dynamic Programming(2012)
Chapter 6. Greedy Algorithms(2012)
Chapter 7. Strongly Connected Components(2012)
(參考資料/自修/選擇性教材) Single-Source Shortest Paths(2012)
Chapter 8. Maximum Flow(2014)
Chapter 9. Maximum Bipartite Matching(2014)
Chapter 10. Linear Programming and Its Application to Game Theory(2014)
*Reference. Chapter 10 投影片資料來源
Chapter 11. NP-Completeness(2014)
Chapter 12. Approximation Algorithms(2012)
Appendix:Minimum Cost Spanning Tree(自修教材,屬於「資料結構」課程範疇)