Pages that link to "Item:Q3602851"

The following pages link to A PTAS for k-means clustering based on weak coresets (Q3602851):

Displaying 34 items.

• Clustering through continuous facility location problems (Q346248) (← links)
• A randomized PTAS for the minimum consensus clustering with a fixed number of clusters (Q418755) (← links)
• A simple \(D^2\)-sampling based PTAS for \(k\)-means and other clustering problems (Q486976) (← links)
• A quantization framework for smoothed analysis of Euclidean optimization problems (Q893320) (← links)
• Single facility collection depots location problem in the plane (Q1025297) (← links)
• Faster algorithms for the constrained \(k\)-means problem (Q1702850) (← links)
• An efficient \(K\)-means clustering algorithm for tall data (Q1987188) (← links)
• An approximation algorithm for the uniform capacitated \(k\)-means problem (Q2082194) (← links)
• A strong coreset algorithm to accelerate OPF as a graph-based machine learning in large-scale problems (Q2124197) (← links)
• Preclustering algorithms for imprecise points (Q2144264) (← links)
• A unified framework for clustering constrained data without locality property (Q2300724) (← links)
• Probabilistic \(k\)-median clustering in data streams (Q2344214) (← links)
• Improved PTAS for the constrained \(k\)-means problem (Q2424715) (← links)
• Learning big (image) data via coresets for dictionaries (Q2513397) (← links)
• Core-Sets: Updated Survey (Q3297370) (← links)
• Turning Big Data Into Tiny Data: Constant-Size Coresets for $k$-Means, PCA, and Projective Clustering (Q3304733) (← links)
• Facility Location in Dynamic Geometric Data Streams (Q3541125) (← links)
• (Q4558482) (← links)
• A Streaming Algorithm for k-Means with Approximate Coreset (Q4631688) (← 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)
• Approximate Clustering with Same-Cluster Queries (Q4993306) (← links)
• Semi-Supervised Algorithms for Approximately Optimal and Accurate Clustering (Q5002733) (← links)
• An improved primal-dual approximation algorithm for the <i>k</i>-means problem with penalties (Q5048009) (← links)
• Coresets for Fuzzy K-Means with Applications (Q5091038) (← links)
• Better Guarantees for $k$-Means and Euclidean $k$-Median by Primal-Dual Algorithms (Q5117377) (← links)
• (Q5214247) (← links)
• (Q5743480) (← links)
• (Q5743481) (← links)
• Improved Algorithms for Time Decay Streams (Q5875480) (← links)
• FPT Approximation for Constrained Metric k-Median/Means (Q6089659) (← links)
• Clustering with faulty centers (Q6092308) (← links)
• Polynomial approximate discretization of geometric centers in high-dimensional Euclidean space (Q6161667) (← links)
• Coresets for kernel clustering (Q6613883) (← links)