Posted by: atri | October 24, 2012

Lect 22: Greedy Algorithm for Scheduling to Minimize Lateness

In today’s lecture, we started proving the correctness of the greedy algorithm. Next lecture, we will continue with proving the correctness of the algorithm. This material is from Section 4.2 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: