Linear-size universal discretization of geometric center-based problems in fixed dimensions
From MaRDI portal
Publication:2125228
DOI10.1007/s10878-021-00790-6zbMath1490.90296arXiv2108.10900OpenAlexW3202959639MaRDI QIDQ2125228
Publication date: 13 April 2022
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2108.10900
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Clustering through continuous facility location problems
- A simple \(D^2\)-sampling based PTAS for \(k\)-means and other clustering problems
- Iterated nearest neighbors and finding minimal polytopes
- On approximate geometric \(k\)-clustering
- Exact and approximation algorithms for clustering
- Complexity and approximation of the smallest \(k\)-enclosing ball problem
- Approximation scheme for the problem of weighted 2-clustering with a fixed center of one cluster
- Finding k points with minimum diameter and related problems
- Linear-time approximation schemes for clustering problems in any dimensions
- Approximate clustering via core-sets
- Bypassing the embedding
- On coresets for k-means and k-median clustering
- On k-Median clustering in high dimensions
- A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fields
- Some Estimates on the Discretization of Geometric Center-Based Problems in High Dimensions
- An approximation scheme for a problem of search for a vector subset
- Approximate minimum enclosing balls in high dimensions using core-sets
- Fast Construction of Nets in Low-Dimensional Metrics and Their Applications
- The approximate rank of a matrix and its algorithmic applications
