演算法設計及分析
出自中山電機所 無線行動網路實驗室
（修訂版本間差異）
| 第1行： | 第1行： | ||
| - | === '''研究所課程, 2019 Spring, Thu 2:10~5:00 PM, EC3009''' === | + | === '''研究所課程, 2019 Spring, Thu 2:10~5:00 PM, EC3009<br><br>已經可以下載''' === |
[http://wmi.ee.nsysu.edu.tw/enter/images/d/dd/Alg20Ch0Textbook.pdf Chapter 0. 學期成績計分方式] | [http://wmi.ee.nsysu.edu.tw/enter/images/d/dd/Alg20Ch0Textbook.pdf Chapter 0. 學期成績計分方式] | ||
| 第5行： | 第5行： | ||
[http://wmi.ee.nsysu.edu.tw/enter/images/8/87/Alg20Ch1Introduction.pdf Chapter 1. Introduction] | [http://wmi.ee.nsysu.edu.tw/enter/images/8/87/Alg20Ch1Introduction.pdf Chapter 1. Introduction] | ||
| - | Chapter 2. Growth of Functions | + | [http://wmi.ee.nsysu.edu.tw/enter/images/a/ae/Alg20Ch2GrowthFunction.pdf Chapter 2. Growth of Functions] |
| - | Chapter 3. Divide and Conquer | + | [http://wmi.ee.nsysu.edu.tw/enter/images/1/1c/Alg20Ch3DivideConquer.pdf Chapter 3. Divide and Conquer] |
| - | Chapter 4. Randomized Algorithms | + | [http://wmi.ee.nsysu.edu.tw/enter/images/d/dc/Alg20Ch4RandomizedAlg.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 習題解答] | ||
| 第15行： | 第15行： | ||
[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] （參考資料，自我學習，上課不教，考試不考） | ||
| - | Chapter 5. Dynamic Programming | + | [http://wmi.ee.nsysu.edu.tw/enter/images/9/99/Alg20Ch5DynamicProgram.pdf Chapter 5. Dynamic Programming] |
| - | Chapter 6. Greedy Algorithms <br> | + | [http://wmi.ee.nsysu.edu.tw/enter/images/1/11/Alg20Ch6GreedyAlg.pdf Chapter 6. Greedy Algorithms] <br> |
| - | Chapter 7. Graph Traversal Techniques<br> | + | [http://wmi.ee.nsysu.edu.tw/enter/images/a/a4/Alg20Ch7EleGraphAlg.pdf Chapter 7. Graph Traversal Techniques]<br> |
| - | + | [http://wmi.ee.nsysu.edu.tw/enter/images/1/12/Alg20Ch8MinSpanningTree.pdf Chapter 8. Minimun Cost Spanning Tree] <br> | |
| - | Chapter | + | [http://wmi.ee.nsysu.edu.tw/enter/images/e/ee/Alg20Ch9MaxFlow.pdf Chapter 9. Maximum Flow] |
| - | + | [http://wmi.ee.nsysu.edu.tw/enter/images/d/d9/Alg20Ch10LinearProgram.pdf Chapter 10. Linear Programming and Its Application to Game Theory] | |
| - | + | ||
| - | Chapter 10. Linear Programming and Its Application to Game Theory | + | |
[http://wmi.ee.nsysu.edu.tw/enter/images/e/ed/LinearProgramming.pdf 註1：Chapter 10 投影片資料來源] | [http://wmi.ee.nsysu.edu.tw/enter/images/e/ed/LinearProgramming.pdf 註1：Chapter 10 投影片資料來源] | ||
| 第33行： | 第31行： | ||
[http://www.cs.columbia.edu/coms6998-3/lpprimer.pdf 註2：Relations between a primary problem and its dual problem] | [http://www.cs.columbia.edu/coms6998-3/lpprimer.pdf 註2：Relations between a primary problem and its dual problem] | ||
| - | Chapter 11. NP-Completeness | + | [http://wmi.ee.nsysu.edu.tw/enter/images/2/2b/Alg20Ch11NPcomplete.pdf Chapter 11. NP-Completeness] |
| - | Chapter 12. Approximation Algorithms<br> | + | [http://wmi.ee.nsysu.edu.tw/enter/images/a/a2/Alg20Ch12Approximation.pdf Chapter 12. Approximation Algorithms]<br> |
<br> | <br> | ||
<br> | <br> | ||
在2020年3月4日 (三) 02:03所做的修訂版本
研究所課程, 2019 Spring, Thu 2:10~5:00 PM, EC3009
已經可以下載
Chapter 2. Growth of Functions
Chapter 4. Randomized Algorithms
*Derandomization of MAX-3SAT （參考資料，自我學習，上課不教，考試不考）
Chapter 5. Dynamic Programming
Chapter 7. Graph Traversal Techniques
Chapter 8. Minimun Cost Spanning Tree
Chapter 10. Linear Programming and Its Application to Game Theory
註2：Relations between a primary problem and its dual problem
Chapter 12. Approximation Algorithms
