MIT
118
Conclusion
l
Randomization is a crucial tool for
algorithm design
l
Often yields algorithms that are faster or
simpler than traditional counterparts
l
In particular, gives significant
improvements for core problems in
graph algorithms