Scribd
Upload
3 views15 pages

Chapter 7 - Dynamic Programming

The document outlines a problem-solving approach using top-down and bottom-up strategies to address independent sub-problems without overlapping work. It includes a reference to finding the shortest path in multistage graphs as an example. The instructor for the session is Suleiman Gargaare.

Uploaded by

abdilatif Abdilahi
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
3 views15 pages

Chapter 7 - Dynamic Programming

The document outlines a problem-solving approach using top-down and bottom-up strategies to address independent sub-problems without overlapping work. It includes a reference to finding the shortest path in multistage graphs as an example. The instructor for the session is Suleiman Gargaare.

Uploaded by

abdilatif Abdilahi
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Instructor: Suleiman Gargaare

Top-down
Prob

Subprob Subprob

…
…

Independent sub-problems (no overlapping work).


Prob

Subprob1 Subprob2

Subproblem
Subprob3 sharing
Subprob4
Subprob7

Subprob5
Subprob6
Bottom-up
• Find the shortest path in multistage graphs for the
following example?

You might also like