Today's lecture, and the two lectures next week are the final three lectures of the course. Today we will do a bit more on approximation algorithms, in particular we will discuss the max-cut problem.

Next week we'll talk a bit more about online algorithms via solving LPs, and also on using the ideas behind online learning algorithms to solve LPs offline.

## Monday, November 23, 2009

Subscribe to:
Post Comments (Atom)

Update: Danny will be lecturing today on persistent search trees. Just a heads-up...

ReplyDelete