演算法設計及分析
出自中山電機所 無線行動網路實驗室
(修訂版本間差異)
第33行: | 第33行: | ||
Chapter 12. NP-Completeness | Chapter 12. NP-Completeness | ||
- | + | Chapter 13. Approximation Algorithms<br> | |
<br> | <br> | ||
<br> | <br> |
在2021年2月25日 (四) 13:11所做的修訂版本
研究所課程, 2021 Spring, Thu 2:10~5:00 PM, EC3013
Chapter 0. 學期成績計分方式
Chapter 1. Introduction
Chapter 2. Growth of Functions
Chapter 3. Divide and Conquer
Chapter 4. Randomized Algorithms
*Derandomization of MAX-3SAT (參考資料,自我學習,上課不教,考試不考)
Chapter 5. Dynamic Programming
Chapter 7. Graph Traversal Techniques
Chapter 8. Minimun Cost Spanning Tree
Chapter 9. Maximum Flow
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 12. NP-Completeness
Chapter 13. Approximation Algorithms