Randomized Algorithms, Carnegie Mellon: Spring 2011
Heads-up for today’s lecture
Today’s lecture will not have notes (like the great ones Avrim’s been handing out), sorry! So you might want to bring along some paper and pencils to take your own notes. 🙂
Also, if you have a minute, look over the randomized rounding algorithm/proof for low-congestion routing we saw in the previous lecture: we’ll try to talk about its derandomization today (among other things).
Comments are closed.