演算法設計及分析
出自中山電機所 無線行動網路實驗室
(修訂版本間差異)
第17行: | 第17行: | ||
[http://wmi.ee.nsysu.edu.tw/enter/images/2/2f/AlgCh5DynamicProgram.pdf Chapter 5. Dynamic Programming] | [http://wmi.ee.nsysu.edu.tw/enter/images/2/2f/AlgCh5DynamicProgram.pdf Chapter 5. Dynamic Programming] | ||
- | [http://wmi.ee.nsysu.edu.tw/enter/images/f/f5/AlgCh6Greedy.pdf Chapter 6. Greedy Algorithms] | + | [http://wmi.ee.nsysu.edu.tw/enter/images/f/f5/AlgCh6Greedy.pdf Chapter 6. Greedy Algorithms] <br> |
[http://wmi.ee.nsysu.edu.tw/enter/images/7/76/AlgCh7BasicGraphAlg.pdf Chapter 7. Graph Traversal Techniques]<br> | [http://wmi.ee.nsysu.edu.tw/enter/images/7/76/AlgCh7BasicGraphAlg.pdf Chapter 7. Graph Traversal Techniques]<br> | ||
第25行: | 第25行: | ||
[http://wmi.ee.nsysu.edu.tw/enter/images/6/60/AlgCh8MST.pdf Chapter 8. Minimun Cost Spanning Tree] (對應4/4兒童節放假,2019上課不教) | [http://wmi.ee.nsysu.edu.tw/enter/images/6/60/AlgCh8MST.pdf Chapter 8. Minimun Cost Spanning Tree] (對應4/4兒童節放假,2019上課不教) | ||
- | + | Chapter 9. Maximum Flow'''(預計 5月20日更新)''' | |
[http://wmi.ee.nsysu.edu.tw/enter/images/b/ba/AlgCh10Simplex.pdf Chapter 10. Linear Programming and Its Application to Game Theory] | [http://wmi.ee.nsysu.edu.tw/enter/images/b/ba/AlgCh10Simplex.pdf Chapter 10. Linear Programming and Its Application to Game Theory] | ||
第31行: | 第31行: | ||
[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 投影片資料來源] | ||
- | [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] |
[http://wmi.ee.nsysu.edu.tw/enter/images/7/79/AlgCh11NPC.pdf Chapter 11. NP-Completeness] | [http://wmi.ee.nsysu.edu.tw/enter/images/7/79/AlgCh11NPC.pdf Chapter 11. NP-Completeness] |
在2019年5月17日 (五) 15:53所做的修訂版本
研究所課程, 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
期中考 (2019/04/25)
Chapter 8. Minimun Cost Spanning Tree (對應4/4兒童節放假,2019上課不教)
Chapter 9. Maximum Flow(預計 5月20日更新)
Chapter 10. Linear Programming and Its Application to Game Theory
註2:Relations between a primary problem and its dual problem
Chapter 12. Approximation Algorithms