Small space representations for metric min-sum k-clustering and their applications
From MaRDI portal
(Redirected from Publication:968274)
Small space representations for metric min-sum \(k\)-clustering and their applications
Small space representations for metric min-sum \(k\)-clustering and their applications
Recommendations
- Small Space Representations for Metric Min-Sum k-Clustering and Their Applications
- Approximating min-sum k -clustering in metric spaces
- On Coresets for k-Median and k-Means Clustering in Metric and Euclidean Spaces and Their Applications
- On coresets for k-means and k-median clustering
- Approximation algorithms for min-sum \(k\)-clustering and balanced \(k\)-median
Cites work
- scientific article; zbMATH DE number 5605086 (Why is no real title available?)
- scientific article; zbMATH DE number 1559578 (Why is no real title available?)
- scientific article; zbMATH DE number 5019895 (Why is no real title available?)
- A \(k\)-median algorithm with running time independent of data size
- A randomized approximation scheme for metric MAX-CUT
- Abstract Combinatorial Programs and Efficient Property Testers
- Advances in metric embedding theory
- Algorithms for dynamic geometric problems over data streams
- Approximate clustering via core-sets
- Approximating min-sum k -clustering in metric spaces
- Approximation algorithms for min-sum \(p\)-clustering
- Approximation schemes for clustering problems
- Automata, Languages and Programming
- Automata, Languages and Programming
- Better streaming algorithms for clustering problems
- Clustering for edge-cost minimization (extended abstract)
- Coresets in dynamic geometric data streams
- Data streams: algorithms and applications.
- Geometric algorithms for the minimum cost assignment problem
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Memoryless Facility Location in One Pass
- On k-Median clustering in high dimensions
- On average distortion of embedding metrics into the line and into l₁
- On coresets for k-means and k-median clustering
- Optimal time bounds for approximate clustering
- P-Complete Approximation Problems
- Profit-earning facility location
- Projective clustering in high dimensions using core-sets
- Property testing and its connection to learning and approximation
- Quick k-Median, k-Center, and Facility Location for Sparse Graphs
- Smaller coresets for k-median and k-means clustering
- Sublinear time algorithms for metric space problems
- Sublinear time approximate clustering
- Sublinear‐time approximation algorithms for clustering via random sampling
- Testing of Clustering
- Tolerant property testing and distance approximation
Cited in
(5)
This page was built for publication: Small space representations for metric min-sum \(k\)-clustering and their applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q968274)
