演算法設計及分析
出自中山電機所 無線行動網路實驗室
（修訂版本間差異）
| 第3行： | 第3行： | ||
[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] | ||
| - | [http://wmi.ee.nsysu.edu.tw/enter/images/f/f8/Alg20Ch2GrowthFunctionV2.pdf Chapter 2. Growth of Functions] | + | [http://wmi.ee.nsysu.edu.tw/enter/images/f/f8/Alg20Ch2GrowthFunctionV2.pdf Chapter 2. Growth of Functions] |
| - | [http://wmi.ee.nsysu.edu.tw/enter/images/3/3d/Alg20Ch3DivideConquerV3.pdf Chapter 3. Divide and Conquer] | + | [http://wmi.ee.nsysu.edu.tw/enter/images/3/3d/Alg20Ch3DivideConquerV3.pdf Chapter 3. Divide and Conquer] |
[http://wmi.ee.nsysu.edu.tw/enter/images/d/dc/Alg20Ch4RandomizedAlg.pdf Chapter 4. Randomized Algorithms] | [http://wmi.ee.nsysu.edu.tw/enter/images/d/dc/Alg20Ch4RandomizedAlg.pdf Chapter 4. Randomized Algorithms] | ||
| 第23行： | 第23行： | ||
[http://wmi.ee.nsysu.edu.tw/enter/images/e/ee/Alg20Ch9MaxFlow.pdf Chapter 9. Maximum Flow] | [http://wmi.ee.nsysu.edu.tw/enter/images/e/ee/Alg20Ch9MaxFlow.pdf Chapter 9. Maximum Flow] | ||
| - | + | Chapter 10. Maximum Matching | |
| - | [http://wmi.ee.nsysu.edu.tw/enter/images/e/ed/LinearProgramming.pdf 註1：Chapter | + | [http://wmi.ee.nsysu.edu.tw/enter/images/d/d9/Alg20Ch10LinearProgram.pdf Chapter 11. Linear Programming and Its Application to Game Theory] |
| + | |||
| + | [http://wmi.ee.nsysu.edu.tw/enter/images/e/ed/LinearProgramming.pdf 註1：Chapter 11 投影片資料來源] | ||
[http://www.cs.columbia.edu/coms6998-3/lpprimer.pdf 註2：Relations between a primal problem and its dual problem] | [http://www.cs.columbia.edu/coms6998-3/lpprimer.pdf 註2：Relations between a primal problem and its dual problem] | ||
| - | [http://wmi.ee.nsysu.edu.tw/enter/images/2/2b/Alg20Ch11NPcomplete.pdf Chapter | + | [http://wmi.ee.nsysu.edu.tw/enter/images/2/2b/Alg20Ch11NPcomplete.pdf Chapter 12. NP-Completeness] |
| - | [http://wmi.ee.nsysu.edu.tw/enter/images/a/a2/Alg20Ch12Approximation.pdf Chapter | + | [http://wmi.ee.nsysu.edu.tw/enter/images/a/a2/Alg20Ch12Approximation.pdf Chapter 13. Approximation Algorithms]<br> |
<br> | <br> | ||
<br> | <br> | ||
在2021年2月25日 (四) 13:03所做的修訂版本
研究所課程, 2019 Spring, Thu 2:10~5:00 PM, EC3009
Chapter 0. 學期成績計分方式
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. Maximum Matching
Chapter 11. Linear Programming and Its Application to Game Theory
註2：Relations between a primal problem and its dual problem
Chapter 13. Approximation Algorithms
