演算法設計及分析
出自中山電機所 無線行動網路實驗室
(修訂版本間差異)
第3行: | 第3行: | ||
[http://wmi.ee.nsysu.edu.tw/enter/images/6/6a/2014AlgLecture1.pdf Chapter 1. Introduction](2014) | [http://wmi.ee.nsysu.edu.tw/enter/images/6/6a/2014AlgLecture1.pdf Chapter 1. Introduction](2014) | ||
- | Chapter 2. Growth of | + | [http://wmi.ee.nsysu.edu.tw/enter/images/5/55/2014AlgLecture2.pdf Chapter 2. Growth of Functions](2014) |
- | Chapter 3. Divide and | + | [http://wmi.ee.nsysu.edu.tw/enter/images/d/dc/2014AlgLecture3.pdf Chapter 3. Divide and Conquer](2014) |
- | Chapter 4. Randomized | + | [http://wmi.ee.nsysu.edu.tw/enter/images/8/87/2014AlgLecture4.pdf Chapter 4. Randomized Algorithms](2014) |
[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 | + | [http://wmi.ee.nsysu.edu.tw/enter/images/4/49/2014AlgLecture5.pdf Chapter 5. Dynamic Programming](2012) |
- | Chapter 6. Greedy | + | [http://wmi.ee.nsysu.edu.tw/enter/images/1/14/2014AlgLecture6.pdf Chapter 6. Greedy Algorithms](2012) |
- | Chapter 7. Strongly Connected | + | [http://wmi.ee.nsysu.edu.tw/enter/images/1/11/2014AlgLecture7.pdf Chapter 7. Strongly Connected Components](2012)<br> |
[http://wmi.ee.nsysu.edu.tw/enter/images/2/2c/2012_Lecture_9_Single-Source_Shortest_PathsV2.pdf '''(參考資料/自修)''' Single-Source Shortest Paths](2012) | [http://wmi.ee.nsysu.edu.tw/enter/images/2/2c/2012_Lecture_9_Single-Source_Shortest_PathsV2.pdf '''(參考資料/自修)''' Single-Source Shortest Paths](2012) | ||
- | Chapter 8. Maximum | + | [http://wmi.ee.nsysu.edu.tw/enter/images/3/3a/2014AlgLecture8.pdf Chapter 8. Maximum Flow](2014) |
- | Chapter 9. Maximum Bipartite | + | [http://wmi.ee.nsysu.edu.tw/enter/images/0/08/2014AlgLecture9.pdf Chapter 9. Maximum Bipartite Matching](2014) |
- | Chapter 10. Linear Programming and Its Application to Game | + | [http://wmi.ee.nsysu.edu.tw/enter/images/1/10/2014AlgLecture10.pdf Chapter 10. Linear Programming and Its Application to Game Theory](2014) |
[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- | + | [http://wmi.ee.nsysu.edu.tw/enter/images/a/ad/2014AlgLecture11.pdf Chapter 11. NP-Completeness](2014) |
- | Chapter 12. Approximation | + | [http://wmi.ee.nsysu.edu.tw/enter/images/e/e3/2014AlgLecture12.pdf Chapter 12. Approximation Algorithms](2012)<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> |
在2014年2月24日 (一) 14:37所做的修訂版本
研究所課程, 2014 Spring, Wed 1:10~4:00 PM, F3010
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(自修教材,屬於「資料結構」課程範疇)