演算法設計及分析
出自中山電機所 無線行動網路實驗室
(修訂版本間差異)
第3行: | 第3行: | ||
'''2015 投影片教材懶人包(製作中)''' | '''2015 投影片教材懶人包(製作中)''' | ||
- | + | Chapter 1. Introduction(2015) | |
- | + | Chapter 2. Growth of Functions(2015) | |
- | + | Chapter 3. Divide and Conquer(2015) | |
- | + | Chapter 4. Randomized Algorithms(2015) | |
[http://wmi.ee.nsysu.edu.tw/enter/images/d/d7/Solution_to_Exercise_of_Chpater_5.pdf '''Chapter 4習題解答'''] | [http://wmi.ee.nsysu.edu.tw/enter/images/d/d7/Solution_to_Exercise_of_Chpater_5.pdf '''Chapter 4習題解答'''] | ||
- | + | Chapter 5. Dynamic Programming(2015) | |
- | + | Chapter 6. Greedy Algorithms(2015) | |
- | + | Chapter 7. Strongly Connected Components(2015)<br> | |
- | + | Chapter 8. Single-Source Shortest Paths(2012) | |
- | + | Chapter 9. Maximum Flow(2015) | |
- | + | Chapter 10. Linear Programming and Its Application to Game Theory(2015) | |
- | + | ||
- | + | ||
- | + | ||
- | + | ||
[http://wmi.ee.nsysu.edu.tw/enter/images/3/32/Linear_programing_and_its_applications.pdf *Reference. '''Chapter 10 投影片資料來源'''] | [http://wmi.ee.nsysu.edu.tw/enter/images/3/32/Linear_programing_and_its_applications.pdf *Reference. '''Chapter 10 投影片資料來源'''] | ||
- | + | Chapter 11. NP-Completeness(2015) | |
- | + | Chapter 12. Approximation Algorithms(2015)<br> | |
- | [http://wmi.ee.nsysu.edu.tw/enter/images/b/bc/2012_Appendix_Minimum_Cost_Spanning_Tree.pdf Appendix:Minimum Cost Spanning Tree] | + | [http://wmi.ee.nsysu.edu.tw/enter/images/b/bc/2012_Appendix_Minimum_Cost_Spanning_Tree.pdf Appendix:Minimum Cost Spanning Tree](自學教材,屬於「資料結構」課程範疇) |
<br> | <br> |
在2015年2月17日 (二) 17:43所做的修訂版本
研究所課程, 2014 Spring, Wed 1:10~4:00 PM, F3010
2015 投影片教材懶人包(製作中)
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(2012)
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(自學教材,屬於「資料結構」課程範疇)