Differences
This shows you the differences between two versions of the page.
Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
courses:cs211:winter2014:journals:kinsey:home [2014/03/11 00:21] โ schellk | courses:cs211:winter2014:journals:kinsey:home [2014/04/03 15:32] (current) โ [7.7] schellk | ||
---|---|---|---|
Line 164: | Line 164: | ||
BOOM. | BOOM. | ||
Readability: | Readability: | ||
+ | |||
+ | ====== Chapter 6: Dynamic Programming ====== | ||
+ | {{: | ||
+ | Readability: | ||
+ | ====== 6.1 Weighted Interval Scheduling a Recursive Procedure ====== | ||
+ | {{: | ||
+ | {{: | ||
+ | Readability: | ||
+ | ====== 6.2 Principles of Dynamic Programming: | ||
+ | {{: | ||
+ | Readability: | ||
+ | ====== 6.3 Segmented Least Squares: Multiway Choices====== | ||
+ | {{: | ||
+ | {{: | ||
+ | |||
+ | Readability: | ||
+ | ====== 6.4 Subset Sums and Knapsacks: Adding a Variable ====== | ||
+ | {{: | ||
+ | {{: | ||
+ | Readability: | ||
+ | |||
+ | ====== 7.1 Maximum Flow Problem and the Ford-Fulkerson Algorithm ====== | ||
+ | {{: | ||
+ | Readability: | ||
+ | ====== 7.2 Maximum Flows and Minimum Cuts in a Network ====== | ||
+ | {{: | ||
+ | Readability: | ||
+ | |||
+ | ====== 7.5 ====== | ||
+ | {{: | ||
+ | Readability: | ||
+ | |||
+ | ====== 7.7 ====== | ||
+ | {{: | ||
+ | Readability: | ||