課程大綱：短路徑、NP完全問題及其處理方法培訓
Week 1The Bellman-Ford algorithm; all-pairs shortest paths.
Week 2NP-complete problems and exact algorithms for them.
Week 3Approximation algorithms for NP-complete problems.
Week 4Local search algorithms for NP-complete problems; the wider world of algorithms.
加入高級會員獲得助教答疑
