Posted by: atri | October 20, 2011

Lect 21: Earliest Deadline First Algorithm

In today’s lecture, we started analyzing the correctness of the earliest deadline first greedy algorithm for the scheduling to minimize lateness problem. Next lecture, we will finish the proof (Sec 4.2) and potentially start with the shortest path problem (Sec 4.4).

The slides have been uploaded. Here is the link to the signup form for the mock interviews that Sean mentioned in class today.

Below are links to student 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: