Spielman and Teng introduced the smoothed analysis of algorithms to provide a framework in which one could explain the success in practice of algorithms and heuristics that could not be understood through the traditional worst-case and average-case analyses. In this talk, we survey some of the smoothed analyses that have been performed.
Cite
@article{arxiv.math/0212413,
title = {Smoothed analysis of algorithms},
author = {Daniel A. Spielman and Shang-Hua Teng},
journal= {arXiv preprint arXiv:math/0212413},
year = {2007}
}