Pages that link to "Item:Q5395664"
From MaRDI portal
The following pages link to Smoothed Analysis of the k-Means Method (Q5395664):
Displaying 16 items.
- A bad instance for \texttt{k-means++} (Q393129) (← links)
- A simple \(D^2\)-sampling based PTAS for \(k\)-means and other clustering problems (Q486976) (← links)
- Random shortest paths: non-Euclidean instances for metric optimization problems (Q494931) (← links)
- A quantization framework for smoothed analysis of Euclidean optimization problems (Q893320) (← links)
- Nonlinear multicriteria clustering based on multiple dissimilarity matrices (Q898226) (← links)
- An LP-based \(k\)-means algorithm for balancing weighted point sets (Q1694906) (← links)
- Smoothed analysis of partitioning algorithms for Euclidean functionals (Q1950395) (← links)
- When do birds of a feather flock together? \(k\)-means, proximity, and conic programming (Q2288194) (← links)
- Optimising sum-of-squares measures for clustering multisets defined over a metric space (Q2444542) (← links)
- Towards Understanding the Smoothed Approximation Ratio of the 2-Opt Heuristic (Q3448843) (← links)
- Smoothed Analysis of Local Search Algorithms (Q3449848) (← links)
- Smoothed Analysis of the Squared Euclidean Maximum-Cut Problem (Q3452814) (← links)
- Local Search Yields a PTAS for $k$-Means in Doubling Metrics (Q4634026) (← links)
- Local Search Yields Approximation Schemes for $k$-Means and $k$-Median in Euclidean and Minor-Free Metrics (Q4634032) (← links)
- A Friendly Smoothed Analysis of the Simplex Method (Q5129232) (← links)
- Speeding up random walk mixing by starting from a uniform vertex (Q6126961) (← links)