Pages that link to "Item:Q1577548"

The following pages link to On approximate geometric \(k\)-clustering (Q1577548):

Displaying 30 items.

• Clustering through continuous facility location problems (Q346248) (← links)
• A simple \(D^2\)-sampling based PTAS for \(k\)-means and other clustering problems (Q486976) (← links)
• A local search approximation algorithm for \(k\)-means clustering (Q598232) (← links)
• Quantization-based clustering algorithm (Q975175) (← links)
• Faster algorithms for the constrained \(k\)-means problem (Q1702850) (← links)
• An efficient \(K\)-means clustering algorithm for tall data (Q1987188) (← links)
• K-means clustering via a nonconvex optimization approach (Q2117651) (← links)
• A refined approximation for Euclidean \(k\)-means (Q2122798) (← links)
• Linear-size universal discretization of geometric center-based problems in fixed dimensions (Q2125228) (← links)
• An exact algorithm for stable instances of the \(k\)-means problem with penalties in fixed-dimensional Euclidean space (Q2165794) (← links)
• Approximation algorithms for spherical \(k\)-means problem using local search scheme (Q2220852) (← links)
• Local search approximation algorithms for the sum of squares facility location problems (Q2274862) (← links)
• A unified framework for clustering constrained data without locality property (Q2300724) (← links)
• Local search approximation algorithms for the \(k\)-means problem with penalties (Q2420650) (← links)
• Approximation algorithm for squared metric facility location problem with nonuniform capacities (Q2422751) (← links)
• A linear time algorithm for approximate 2-means clustering (Q2573339) (← links)
• Sublinear‐time approximation algorithms for clustering via random sampling (Q3419620) (← links)
• A FAST IMPLEMENTATION OF THE ISODATA CLUSTERING ALGORITHM (Q3430335) (← links)
• A FAST k-MEANS IMPLEMENTATION USING CORESETS (Q3604141) (← links)
• A Streaming Algorithm for k-Means with Approximate Coreset (Q4631688) (← links)
• (Q4633019) (← links)
• Local Search Yields a PTAS for $k$-Means in Doubling Metrics (Q4634026) (← links)
• Randomized Spectral Clustering in Large-Scale Stochastic Block Models (Q5057098) (← links)
• (Q5075771) (← links)
• Better Guarantees for $k$-Means and Euclidean $k$-Median by Primal-Dual Algorithms (Q5117377) (← links)
• (Q5214247) (← links)
• (Q5743481) (← links)
• Effective Heuristic Techniques for Combined Robust Clustering Problem (Q6053497) (← links)
• Local search yields a PTAS for fixed-dimensional \(k\)-means problem with penalties (Q6566778) (← links)
• Approximation algorithms for robust clustering problems using local search techniques (Q6636083) (← links)