Posted by: atri | October 12, 2012

Lect 18: Greedy Algorithms

Today we started with greedy algorithms and we looked at the interval scheduling problem. We also looked at four potential greedy algorithm and saw that all but the algorithm that schedules the task with the earliest finish time first do not produce optimal schedules. On Monday, Jesse will prove the correctness of the algorithm. All this material is from Section 4.1 in the book.

The slides and notes for the lecture 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: