Smoothed Analysis of the Squared Euclidean Maximum-Cut Problem (Q3452814): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-662-48350-3_43
+Normal rank
@@ Property / OpenAlex ID @@
+W2295408917
@@ Property / OpenAlex ID: W2295408917 / rank @@
+Normal rank
@@ Property / cites work @@
+Smoothed Analysis of the k-Means Method
@@ Property / cites work: Smoothed Analysis of the k-Means Method / rank @@
+Normal rank
@@ Property / cites work @@
+Worst-Case and Smoothed Analysis of the ICP Algorithm, with an Application to the k-Means Method
+Normal rank
@@ Property / cites work @@
+Settling the Complexity of Local Max-Cut (Almost) Completely
+Normal rank
@@ Property / cites work @@
+Worst case and probabilistic analysis of the 2-Opt algorithm for the TSP
+Normal rank
@@ Property / cites work @@
+Smoothed Analysis of Local Search for the Maximum-Cut Problem
+Normal rank
@@ Property / cites work @@
+A local search approximation algorithm for \(k\)-means clustering
+Normal rank
@@ Property / cites work @@
+Smoothed Analysis of the 2-Opt Heuristic for the TSP: Polynomial Bounds for Gaussian Noise
+Normal rank
@@ Property / cites work @@
+Smoothed Analysis of the Condition Numbers and Growth Factors of Matrices
+Normal rank
@@ Property / cites work @@
+Simple Local Search Problems that are Hard to Solve
+Normal rank
@@ Property / cites work @@
+Clustering for edge-cost minimization (extended abstract)
+Normal rank
@@ Property / cites work @@
+Smoothed analysis of algorithms
@@ Property / cites work: Smoothed analysis of algorithms / rank @@
+Normal rank