A Composable Coreset for k-Center in Doubling Metrics (original) (raw)
Related papers
Epsilon-Coresets for Clustering (with Outliers) in Doubling Metrics
2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS), 2018
An Algorithm and a Core Set Result for the Weighted Euclidean One-Center Problem
INFORMS Journal on Computing, 2009
ε-Coresets for Clustering (with Outliers) in Doubling Metrics
2018
Approximate minimum enclosing balls in high dimensions using core-sets
ACM Journal of Experimental Algorithms, 2003
A new coreset framework for clustering
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021
Best approximation in metric spaces
Proceedings of the American Mathematical Society, 1988
Improved Approximation for Metric Multi-Cover
2016
On Approximability of Clustering Problems Without Candidate Centers
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA)
Asymmetric k -center is log * n -hard to approximate
Journal of the ACM, 2005
Approximation algorithms for the k-center problem: an experimental evaluation
Parameterized Approximation Algorithms for K-center Clustering and Variants
Proceedings of the AAAI Conference on Artificial Intelligence
Approximability Results for the p-Center Problem Algorithm Design and Analysis
Divide-and-conquer approximation algorithms via spreading metrics
Journal of The ACM, 2000
Computing Core-Sets and Approximate Smallest Enclosing HyperSpheres in High Dimensions
Improved Coresets and Sublinear Algorithms for Power Means in Euclidean Spaces
2021
Some remarks on an efficient algorithm to find a centroid in a k-dimensional real space
Applied Mathematical Sciences, 2016
Approximating the diameter of a set of points in the Euclidean space
Omer Egecioglu, Bahman Kalantari
Information Processing Letters, 1989
Towards optimal lower bounds for k-median and k-means coresets
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing
2020
Approximation algorithms for the mobile piercing set problem with applications to clustering
2001
Smaller coresets for k-median and k-means clustering
2005
Coresets for clustering in Euclidean spaces: importance sampling is nearly optimal
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020
Linear-time approximation schemes for clustering problems in any dimensions
Journal of The ACM, 2010
Introduction to Coresets: Approximated Mean
arXiv (Cornell University), 2021
On the general distance problem in RkR^kRk
On the general distance problem in RkR^kRk, 2022
On Metric Multi-Covering Problems
arXiv: Computational Geometry, 2016
European Journal of Mathematics
Approximation algorithms for clustering problems
Computational Learning Theory, 1999
Approximate Best Proximity Pairs in Metric Space
Abstract and Applied Analysis, 2011
Exact Algorithms and Lower Bounds for Stable Instances of Euclidean k-MEANS
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019
A Constant-Factor Approximation Algorithm for the k-Median Problem
Journal of Computer and System Sciences, 2002
The centroid of points with approximate weights
Lecture Notes in Computer Science, 1995