Posted by: atri | November 28, 2012

Lect 35: Weighted Interval Scheduling

Today we started with dynamic programming and the weighted interval scheduling problem. Next lecture, we will first develop the recursive algorithm and then see how to use memory to improve the runtime. The material is from Section 6.1 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: