演算法設計及分析
出自中山電機所 無線行動網路實驗室
研究所課程, 2016 Spring, Wed 1:10~4:00 PM, F6019
Chapter 1. Introduction(2016/02/25)
Chapter 2. Growth of Functions(2016/02/25)
Chapter 3. Divide and Conquer(2015)
Chapter 4. Randomized Algorithms(2016/02/24)
Chapter 4 習題解答(更新/2015)
*Derandomization of MAX 3SAT (參考資料)
Chapter 5. Dynamic Programming(自我評量有更新 2016/02/25)
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(自學教材,屬於「資料結構」課程範疇)