演算法設計及分析
出自中山電機所 無線行動網路實驗室
（修訂版本間差異）
| 第1行： | 第1行： | ||
=== '''研究所課程, 2016 Spring, Wed 1:10~4:00 PM, F6019''' === | === '''研究所課程, 2016 Spring, Wed 1:10~4:00 PM, F6019''' === | ||
| - | [http://wmi.ee.nsysu.edu.tw/enter/images/8/89/2016Ch1IntroductionV6.pdf Chapter 1. Introduction] | + | [http://wmi.ee.nsysu.edu.tw/enter/images/8/89/2016Ch1IntroductionV6.pdf Chapter 1. Introduction] |
| - | [http://wmi.ee.nsysu.edu.tw/enter/images/e/ed/2016Ch2GrowthOfFunctionsV2.pdf Chapter 2. Growth of Functions] | + | [http://wmi.ee.nsysu.edu.tw/enter/images/e/ed/2016Ch2GrowthOfFunctionsV2.pdf Chapter 2. Growth of Functions] |
| - | [http://wmi.ee.nsysu.edu.tw/enter/images/4/48/2016Ch3DivideConquerV2.pdf Chapter 3. Divide and Conquer] | + | [http://wmi.ee.nsysu.edu.tw/enter/images/4/48/2016Ch3DivideConquerV2.pdf Chapter 3. Divide and Conquer] |
| - | [http://wmi.ee.nsysu.edu.tw/enter/images/c/ca/2016Ch4RandomizedV2.pdf Chapter 4. Randomized Algorithms] | + | [http://wmi.ee.nsysu.edu.tw/enter/images/c/ca/2016Ch4RandomizedV2.pdf Chapter 4. Randomized Algorithms] |
| - | '''[http://wmi.ee.nsysu.edu.tw/enter/images/9/93/RandAlgChapSol2.pdf Chapter 4 習題解答] | + | '''[http://wmi.ee.nsysu.edu.tw/enter/images/9/93/RandAlgChapSol2.pdf Chapter 4 習題解答]''' |
| - | [http://www.cs.toronto.edu/~bor/373f05/max3sat.pdf *Derandomization of MAX 3SAT] | + | [http://www.cs.toronto.edu/~bor/373f05/max3sat.pdf *Derandomization of MAX 3SAT] （參考資料，自我學習，上課不教，考試不考） |
| - | [http://wmi.ee.nsysu.edu.tw/enter/images/6/66/2016Ch5DynamicProgramming.pdf Chapter 5. Dynamic Programming] | + | [http://wmi.ee.nsysu.edu.tw/enter/images/6/66/2016Ch5DynamicProgramming.pdf Chapter 5. Dynamic Programming] |
| - | [http://wmi.ee.nsysu.edu.tw/enter/images/8/82/2017Ch6Greedy2.pdf Chapter 6. Greedy Algorithms] | + | [http://wmi.ee.nsysu.edu.tw/enter/images/8/82/2017Ch6Greedy2.pdf Chapter 6. Greedy Algorithms] |
| - | [http://wmi.ee.nsysu.edu.tw/enter/images/9/91/2015AlgCh7.pdf Chapter 7. Strongly Connected Components] | + | [http://wmi.ee.nsysu.edu.tw/enter/images/9/91/2015AlgCh7.pdf Chapter 7. Strongly Connected Components]<br> |
[http://wmi.ee.nsysu.edu.tw/enter/images/e/e8/2017Ch8MST.pdf Chapter 8. Minimun Cost Spanning Tree] | [http://wmi.ee.nsysu.edu.tw/enter/images/e/e8/2017Ch8MST.pdf Chapter 8. Minimun Cost Spanning Tree] | ||
| - | [http://wmi.ee.nsysu.edu.tw/enter/images/c/ca/2017Ch9MaxFlow.pdf Chapter 9. Maximum Flow] | + | [http://wmi.ee.nsysu.edu.tw/enter/images/c/ca/2017Ch9MaxFlow.pdf Chapter 9. Maximum Flow] |
| - | [http://wmi.ee.nsysu.edu.tw/enter/images/0/0e/2016Ch10LP7.pdf Chapter 10. Linear Programming and Its Application to Game Theory] | + | [http://wmi.ee.nsysu.edu.tw/enter/images/0/0e/2016Ch10LP7.pdf Chapter 10. Linear Programming and Its Application to Game Theory] |
'''[http://wmi.ee.nsysu.edu.tw/enter/images/3/32/Linear_programing_and_its_applications.pdf Chapter 10 投影片資料來源]''' | '''[http://wmi.ee.nsysu.edu.tw/enter/images/3/32/Linear_programing_and_its_applications.pdf Chapter 10 投影片資料來源]''' | ||
| - | [http://wmi.ee.nsysu.edu.tw/enter/images/0/03/2015AlgCh11.pdf Chapter 11. NP-Completeness] | + | [http://wmi.ee.nsysu.edu.tw/enter/images/0/03/2015AlgCh11.pdf Chapter 11. NP-Completeness] |
| - | [http://wmi.ee.nsysu.edu.tw/enter/images/5/55/2015AlgCh12.pdf Chapter 12. Approximation Algorithms] | + | [http://wmi.ee.nsysu.edu.tw/enter/images/5/55/2015AlgCh12.pdf Chapter 12. Approximation Algorithms]<br> |
<br> | <br> | ||
<br> | <br> | ||
在2016年6月30日 (四) 09:22所做的修訂版本
研究所課程, 2016 Spring, Wed 1:10~4:00 PM, F6019
Chapter 2. Growth of Functions
Chapter 4. Randomized Algorithms
*Derandomization of MAX 3SAT （參考資料，自我學習，上課不教，考試不考）
Chapter 5. Dynamic Programming
Chapter 7. Strongly Connected Components
Chapter 8. Minimun Cost Spanning Tree
Chapter 10. Linear Programming and Its Application to Game Theory
Chapter 12. Approximation Algorithms
