A Second Course in Algorithms (Lecture 18: Five Essential Tools for Analyzing Randomized Algorithms)

preview_player
Показать описание
Five essential tools for the analysis of randomized algorithms (approximate and otherwise). Linearity of expectation and a 7/8-approximation for MAX 3SAT. Markov and Chebyshev inequalities. Chernoff bounds. Running example: analysis of hashing. Randomized rounding for low-congestion routing.
Рекомендации по теме
Комментарии
Автор

Topics: Five essential tools for the analysis of randomized algorithms (approximate and otherwise). Linearity of expectation and a 7/8-approximation for MAX 3SAT. Markov and Chebyshev inequalities. Chernoff bounds. Running example: analysis of hashing. Randomized rounding for low-congestion routing.

TimRoughgarden