Bläser, M. and Manthey, B. and Rao, B.V.R.
Smoothed analysis of partitioning algorithms for Euclidean functionals.
In: 12th International Symposium on Algorithms and Data Structures, WADS 2011, 15-17 Aug 2011, New York, NY, USA.
Lecture Notes in Computer Science 6844.
Full text available as:
PDF - Univ. of Twente only
Official URL: http://dx.doi.org/10.1007/978-3-642-22300-6_10
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.
|Item Type:||Conference or Workshop Paper (Full Paper, Talk)|
|Research Group:||EWI-DMMP: Discrete Mathematics and Mathematical Programming|
|Research Program:||CTIT-IE&ICT: Industrial Engineering and ICT|
|Research Project:||SMABEP: Smoothed Analysis of Belief Propagation|
|Deposited On:||27 September 2011|
Export this item as:
To request a copy of the PDF please email us request copy
To correct this item please ask your editor
Repository Staff Only: edit this item