1. Lecture 37
CSE 331
Nov 30, 2011

2. CSEd Week celebrations
Volunteers needed!

3. Thursday (tomorrow) 6PM Bell 224
CSEd Week (ACM)
Thursday (tomorrow)
6PM
Bell 224

4. Backchannel open today

5. Sample final exam
Posted on the blog

6. Need volunteers for today

7. Fresh off the interwebs

8. Reading Assignment
Sec 6.1, 6.2 of [KT]

9. When to use Dynamic Programming
There are polynomially many sub-problems
Richard Bellman
Optimal solution can be computed from solutions to sub-problems
There is an ordering among sub-problem that allows for iterative solution

10. Shortest Path Problem
Input: (Directed) Graph G=(V,E) and for every edge e has a cost ce (can be <0)
t in V
Output: Shortest path from every s to t
Assume that G has no negative cycle 1
100
-1000
899 s t
Shortest path has cost negative infinity

11. Today’s agenda
Dynamic Program for shortest path

12. May the Bellman force be with you