6.006 21. Dynamic Programming III : Text justification, Knapsack

Add to Favourites
Post to:

Description
In this lecture notes we are going to continue with Dynamic Programming . The topics covered in this section are 1.Text Justification
2. Parenthesization, 3.Knapsack, 4.Pseudopolynomial Time and 5. Tetris Training. Dynamic programming is all about subproblems & guessing.

Instructors: Prof. Erik Demaine, Prof. Ronald Rivest, Prof. Srinivas Devadas, MIT Course Number: 6.006 Level: Undergraduate, 6.006 21. Dynamic programming III: text justification, parenthesization, knapsack, pseudopolynomial time, Tetris training ,Introduction to Algorithms, Electrical Engineering and Computer Science, Engineering, Massachusetts Institute of Technology: MIT Open Course Ware, http://ocw.mit.edu (02-11-2011). License: Creative Commons BY-NC-SA: http://ocw.mit.edu/terms/#cc.


Type: pdf

Discussion
LearnOnline Through OCW
OpenCourseWare
User
149 Followers

Your Facebook Friends on WizIQ