Euclidean optimization problems such as TSP and minimum-length matching admit fast partitioning algorithms that compute near-optimal solutions on typical instances. We develop a general framework for the application of smoothed analysis to partitioning algorithms for Euclidean optimization problems. Our framework can be used to analyze both the running-time and the approximation ratio of such algorithms. We apply our framework to obtain smoothed analyses of Dyer and Frieze's partitioning algorithm for Euclidean matching, Karp's partitioning scheme for the TSP, a heuristic for Steiner trees, and a heuristic for degree-bounded minimum-length spanning trees. © 2011 Springer-Verlag.
CITATION STYLE
Bläser, M., Manthey, B., & Rao, B. V. R. (2011). Smoothed analysis of partitioning algorithms for Euclidean functionals. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6844 LNCS, pp. 110–121). https://doi.org/10.1007/978-3-642-22300-6_10
Mendeley helps you to discover research relevant for your work.