Abstract
Smoothed analysis is a method for analyzing the performance of algorithms for which classical worst-case analysis fails to explain the performance observed in practice. Smoothed analysis has been applied to explain the performance of a variety of algorithms in the last years. One particular class of algorithms where smoothed analysis has been used successfully are local search algorithms. We give a survey of smoothed analysis, in particular applied to local search algorithms.
Cite
CITATION STYLE
Manthey, B. (2015). Smoothed analysis of local search algorithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9214, pp. 518–527). Springer Verlag. https://doi.org/10.1007/978-3-319-21840-3_43
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
