[[courses:cs211:winter2018:journals:bairdc:chapter6]]
Trace: • section_3.6 • section_3.5 • section_4.8 • preface • chapter4 • section_6.3 • chapter2 • chapter7 • chapter5 • chapter6
Show pagesource
Recent ChangesSitemap

This is an old revision of the document!

Table of Contents

Chapter 6 – Dynamic Programming

My notes on the assigned sections of Chapter 6 of Algorithm Design by Jon Kleinberg and Éva Tardos. This chapter details dynamic programming. Dynamic programming involves

6.1 – Weighted Interval Scheduling: A Recursive Procedure

6.2 – Principles of Dynamic Programming: Memoization or Iteration over Subproblems

6.3 – Segmented Least Squares: Multi-way Choices

courses/cs211/winter2018/journals/bairdc/chapter6.1522117124.txt.gz · Last modified: by bairdc
Show pagesourceOld revisions
Media ManagerBack to top
CC Attribution-Noncommercial-Share Alike 4.0 International
Driven by DokuWiki Recent changes RSS feed Valid CSS Valid XHTML 1.0