CSE331 Lecture 38

CSE331 Lecture 38 - Lecture 38 CSE 331 Dec 2, 2011 Review...

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

View Full Document Right Arrow Icon
Lecture 38 CSE 331 Dec 2, 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
Review Sessions etc. Atri: (at least ½ of) class next Friday Jiun-Jie: Extra office hour next Friday Jesse: Review Session on Mon, Dec 12 (pick time slot on blog) Temp grades hopefully sometime next week
Background image of page 2
Homework 10 Posted on the blog
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
Need volunteers for today
Background image of page 5

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

View Full DocumentRight Arrow Icon
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
Background image of page 6
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 Richard Bellman
Background image of page 7

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

View Full DocumentRight Arrow Icon
OPT(i,u) = cost of shortest path from u to t with at most i edges OPT(i,u) = min { OPT(i-1,u) , min (u,w) in E { c
Background image of page 8
Image of page 9
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 12/11/2011 for the course CSE 331 taught by Professor Rudra during the Fall '11 term at SUNY Buffalo.

Page1 / 20

CSE331 Lecture 38 - Lecture 38 CSE 331 Dec 2, 2011 Review...

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

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