Pages that link to "Item:Q598232"
From MaRDI portal
The following pages link to A local search approximation algorithm for \(k\)-means clustering (Q598232):
Displaying 28 items.
- Local Search Yields Approximation Schemes for $k$-Means and $k$-Median in Euclidean and Minor-Free Metrics (Q4634032) (← links)
- A Bi-Criteria Approximation Algorithm for k-Means (Q4636444) (← links)
- A Lottery Model for Center-Type Problems With Outliers (Q4972682) (← links)
- A Local-Search Algorithm for Steiner Forest (Q4993295) (← links)
- Approximate Clustering with Same-Cluster Queries (Q4993306) (← links)
- An improved primal-dual approximation algorithm for the <i>k</i>-means problem with penalties (Q5048009) (← links)
- (Q5091190) (← links)
- (Q5091192) (← links)
- SOS-SDP: An Exact Solver for Minimum Sum-of-Squares Clustering (Q5106412) (← links)
- (Q5111721) (← links)
- Better Guarantees for $k$-Means and Euclidean $k$-Median by Primal-Dual Algorithms (Q5117377) (← links)
- The Parallel Seeding Algorithm for k-Means Problem with Penalties (Q5149519) (← links)
- (Q5214247) (← links)
- Complexity of Single-Swap Heuristics for Metric Facility Location and Related Problems (Q5283361) (← links)
- Hidden Integrality and Semirandom Robustness of SDP Relaxation for Sub-Gaussian Mixture Model (Q5868965) (← links)
- Noisy, Greedy and Not so Greedy k-Means++ (Q5874485) (← links)
- (Q5874528) (← links)
- (Q5875462) (← links)
- Algorithms and Computation (Q5897934) (← links)
- A local search approximation algorithm for a squared metric \(k\)-facility location problem (Q5916060) (← links)
- Approximation Algorithms for Matroid and Knapsack Means Problems (Q6053494) (← links)
- Effective Heuristic Techniques for Combined Robust Clustering Problem (Q6053497) (← links)
- Approximation Algorithms for Spherical k-Means Problem with Penalties Using Local Search Techniques (Q6053502) (← links)
- The provably good parallel seeding algorithms for the <i>k</i>‐means problem with penalties (Q6092504) (← links)
- Multiway Spectral Graph Partitioning: Cut Functions, Cheeger Inequalities, and a Simple Algorithm (Q6139651) (← links)
- Local search yields a PTAS for fixed-dimensional \(k\)-means problem with penalties (Q6566778) (← links)
- \(k\)-median/means with outliers revisited: a simple fpt approximation (Q6591646) (← links)
- Approximation algorithms for robust clustering problems using local search techniques (Q6636083) (← links)