CSE331 Lecture 37

CSE331 Lecture 37 - Richard Bellman Shortest Path Problem...

Info iconThis preview shows pages 1–12. Sign up to view the full content.

View Full Document Right Arrow Icon
Lecture 37 CSE 331 Nov 30, 2011
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
CSEd Week celebrations http://csedweek.wordpress.com/ Volunteers needed! Volunteers needed!
Background image of page 2
CSEd Week (ACM) Thursday (tomorrow) 6PM Bell 224
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Backchannel open today
Background image of page 4
Sample final exam Posted on the blog
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Need volunteers for today
Background image of page 6
Fresh off the interwebs
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Reading Assignment Sec 6.1, 6.2 of [KT]
Background image of page 8
When to use Dynamic Programming There are polynomially many sub-problems Optimal solution can be computed from solutions to sub-problems There is an ordering among sub-problem that allows for iterative solution
Background image of page 9

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 10
Background image of page 11

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 12
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Richard Bellman Shortest Path Problem Input: (Directed) Graph G=(V,E) and for every edge e has a cost c e (can be <0 ) t in V Output: Shortest path from every s to t 1 1 100-1000 899 s t Shortest path has cost negative infinity Shortest path has cost negative infinity Assume that G has no negative cycle Assume that G has no negative cycle Todays agenda Dynamic Program for shortest path May the Bellman force be with you...
View Full Document

Page1 / 12

CSE331 Lecture 37 - Richard Bellman Shortest Path Problem...

This preview shows document pages 1 - 12. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online