A quantization framework for smoothed analysis of Euclidean optimization problems

DOI10.1007/978-3-642-40450-4_30MaRDI QIDQ2849327zbMATH OpenOpenAlexFDO

Authors Radu Curticapean, Marvin Künnemann

Publication date 17 September 2013

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-40450-4_30

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Approximation methods and heuristics in mathematical programming (90C59) Analysis of algorithms (68W40) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Recommendations

• A quantization framework for smoothed analysis of Euclidean optimization problems
• Smoothed analysis of the squared Euclidean maximum-cut problem
• Smoothed Analysis of Partitioning Algorithms for Euclidean Functionals
• Smoothed analysis of partitioning algorithms for Euclidean functionals

Cited in

(6)

• Smoothed Analysis of Partitioning Algorithms for Euclidean Functionals
• A quantization framework for smoothed analysis of Euclidean optimization problems
• Smoothed analysis of partitioning algorithms for Euclidean functionals
• Towards Understanding the Smoothed Approximation Ratio of the 2-Opt Heuristic
• Faster p-norm minimizing flows, via smoothed q-norm problems
• Smoothed analysis of local search algorithms

This page was built for publication: A quantization framework for smoothed analysis of Euclidean optimization problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2849327)