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