演算法設計及分析
出自中山電機所 無線行動網路實驗室
(修訂版本間差異)
(→研究所課程, 2011 Spring, Tue 9:00~12:00 AM, F3009) |
|||
第17行: | 第17行: | ||
[http://140.117.157.64/enter/images/a/a7/Lecture_8_Elementary_Grapgh_Algorithms.pdf Chapter 8. Strongly Connected Components](2011/03/08) | [http://140.117.157.64/enter/images/a/a7/Lecture_8_Elementary_Grapgh_Algorithms.pdf Chapter 8. Strongly Connected Components](2011/03/08) | ||
- | [http://140.117.157.64/enter/images/2/20/Lecture_9_Minimum_Spanning_Tree.pdf 資料結構教材(自己研習)Minimum Cost Spanning Tree] | + | [http://140.117.157.64/enter/images/2/20/Lecture_9_Minimum_Spanning_Tree.pdf 資料結構教材(自己研習)Minimum Cost Spanning Tree] |
- | [http://wmi.ee.nsysu.edu.tw/enter/images/f/f5/Lecture_SingleSourceShortestPaths.pdf Chapter 9. Single-Source Shortest Paths](2011/05/10) | + | [http://wmi.ee.nsysu.edu.tw/enter/images/f/f5/Lecture_SingleSourceShortestPaths.pdf Chapter 9. Single-Source Shortest Paths](2011/05/10) |
[http://140.117.157.64/enter/images/a/a0/Lecture_10_Maximum_Flow.pdf Chapter 10. Maximum Flow](2011/03/08) | [http://140.117.157.64/enter/images/a/a0/Lecture_10_Maximum_Flow.pdf Chapter 10. Maximum Flow](2011/03/08) | ||
第27行: | 第27行: | ||
[http://140.117.157.64/enter/images/9/9e/Lecture_12_NP-Completeness.pdf Chapter 12. NP-Completeness](2011/03/08) | [http://140.117.157.64/enter/images/9/9e/Lecture_12_NP-Completeness.pdf Chapter 12. NP-Completeness](2011/03/08) | ||
- | [http://140.117.157.64/enter/images/0/02/Lecture_13_Approximation_Algorithms.pdf Chapter 13. Approximation Algorithms](2011/03/08) | + | [http://140.117.157.64/enter/images/0/02/Lecture_13_Approximation_Algorithms.pdf Chapter 13. Approximation Algorithms](2011/03/08)<br> |
- | + | ||
- | + |
在2011年5月10日 (二) 16:28所做的修訂版本
研究所課程, 2011 Spring, Tue 9:00~12:00 AM, F3009
Chapter 1. Introduction(2011/02/21)
Chapter 2. Growth of Functions(更新。2011/03/08)
Chapter 3. Divide and Conquer(2011/03/08)
Chapter 4. Selection(2011/03/08)
Chapter 5. Randomized Algorithms(2011/03/08)
Chapter 6. Dynamic Programming(2011/03/08)
Chapter 7. Greedy Algorithm(2011/03/08)
Chapter 8. Strongly Connected Components(2011/03/08)
資料結構教材(自己研習)Minimum Cost Spanning Tree
Chapter 9. Single-Source Shortest Paths(2011/05/10)
Chapter 10. Maximum Flow(2011/03/08)
Chapter 11. Linear Programming(2011/03/08)
Chapter 12. NP-Completeness(2011/03/08)
Chapter 13. Approximation Algorithms(2011/03/08)