课程大纲：最短路径、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.
加入高级会员获得助教答疑
