Paper Info
Title
Smoothed Analysis of Local Search Algorithms
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.
Year
Venue
Field
2015
WADS
Computer science,Algorithm,Smoothed analysis,Travelling salesman problem,Local search (optimization)
DocType
Citations 
PageRank 
Conference
0
0.34
References 
Authors
31
1
Name
Order
Citations
PageRank
Bodo Manthey132.79