Posted by: atri | October 13, 2011

Lect 18: Greedy Algorithms

In yesterday’s lecture we started with greedy algorithms and studied a greedy algorithm for the interval scheduling problem. Next lecture, we will complete the proof of correctness and its runtime analysis. The material will be from Sec 4.1 in the textbook.

The slides have been uploaded.

Below are links to the student blog post(s):

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: