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