Posted by: atri | October 20, 2009

Lect 19 slides and definition of greedy algorithms

The slides for lecture 19 are now online.

In class I mentioned there has been some recent research on really defining greedy algorithms and then proving theorems about them. I believe a paper by Allan Borodin, Morten Neilsen and Charles Rackoff is the first paper on the subject (official journal version/ conference version).

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: