Posted by: atri | November 29, 2011

Lect 36: Weighted Interval Scheduling-II

Yesterday, we finished studying the dynamic programming algorithm for the weighted interval scheduling problem. Tomorrow, we will study the shortest path problem (in presence of negative weights): Sec 6.8 in the textbook.

The slides and notes have been uploaded. (I also uploaded the notes for lecture 34.)

Below are links to the student blog posts for the lecture:

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: