Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
- Week 1
- The Bellman-Ford algorithm; all-pairs shortest paths.
- Week 2
- NP-complete problems and exact algorithms for them.
- Week 3
- Approximation algorithms for NP-complete problems.
- Week 4
- Local search algorithms for NP-complete problems; the wider world of algorithms.