The paper by Spielman and Teng, Smoothed Analysis of Algorithms: Why the Simplex Algorithm Usually Takes Polynomial Time (JACM 51(3):385–463, 2004), won a Gdel award in 2008.Since then, has there been a monograph or substantial survey paper written on the subject?The best I could find was a book chapter in Algorithm Engineering by Mller-Hanneman and Shirra.
Monograph or survey paper on smoothed analysis of algorithms
algorithm analysis;reference request