Posted by: atri | November 30, 2012

Lect 36: Iterative Dynamic Programming

In today’s lecture, we designed a dynamic programming based algorithm for the weighted interval scheduling problem. This material was from Sections 6.1 and 6.2 in the textbook. On Monday we will start talking about designing a dynamic programming algorithm for the shortest path problem where edges can have negative weights. This material will be from Section 6.8 in the textbook.

The slides and notes have been uploaded.

Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

Categories

%d bloggers like this: