Cited in
(80)- Practical methods for shape fitting and kinetic data structures using coresets
- On the string consensus problem and the Manhattan sequence consensus problem
- Faster algorithms for the constrained k-means problem
- No dimension-independent core-sets for containment under homothetics
- The 2-center problem in three dimensions
- Faster balanced clusterings in high dimension
- A dual simplex-type algorithm for the smallest enclosing ball of balls
- Uncertainty quantification of the 4th kind; optimal posterior accuracy-uncertainty tradeoff with the minimum enclosing ball
- Approximation and complexity of the capacitated geometric median problem
- Linear-size universal discretization of geometric center-based problems in fixed dimensions
- Parameterized low-rank binary matrix approximation
- Parameterized \(k\)-clustering: tractability island
- Metric \(k\)-median clustering in insertion-only streams
- A unified framework for clustering constrained data without locality property
- Probabilistic k-median clustering in data streams
- Streaming algorithms for extent problems in high dimensions
- A mixed breadth-depth first strategy for the branch and bound tree of Euclidean k-center problems
- On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids
- Improved PTAS for the constrained \(k\)-means problem
- FRSDE: Fast reduced set density estimator using minimal enclosing ball approximation
- Optimal core-sets for balls
- Frequency-based views to pattern collections
- Faster core-set constructions and data-stream algorithms in fixed dimensions
- An efficient inexact Newton-CG algorithm for the smallest enclosing ball problem of large dimensions
- On the \(k\)-means/median cost function
- Accurate low-space approximation of metric k-median for insertion-only streams
- Solving the chromatic cone clustering problem via minimum spanning sphere
- Topographic mapping of large dissimilarity data sets
- Sublinear‐time approximation algorithms for clustering via random sampling
- Clustering through continuous facility location problems
- Fixed-parameter tractability and lower bounds for stabbing problems
- Streaming and dynamic algorithms for minimum enclosing balls in high dimensions
- Streaming with minimum space: an algorithm for covering by two congruent balls
- Some results on approximate 1-median selection in metric spaces
- The maximum vector-angular margin classifier and its fast training on large datasets using a core vector machine
- Local search yields a PTAS for \(k\)-means in doubling metrics
- Local Search Yields Approximation Schemes for k-Means and k-Median in Euclidean and Minor-Free Metrics
- Analysis of agglomerative clustering
- THE SMALLEST ENCLOSING BALL OF BALLS: COMBINATORIAL STRUCTURE AND ALGORITHMS
- A simple \(D^2\)-sampling based PTAS for \(k\)-means and other clustering problems
- Data exploration by representative region selection: axioms and convergence
- Some Estimates on the Discretization of Geometric Center-Based Problems in High Dimensions
- One-dimensional \(k\)-center on uncertain data
- Parameterized low-rank binary matrix approximation
- Polynomial-Time Approximation Schemes for k-center, k-median, and Capacitated Vehicle Routing in Bounded Highway Dimension
- Greedy Strategy Works for k-Center Clustering with Outliers and Coreset Construction
- Probabilistic smallest enclosing ball in high dimensions via subgradient sampling
- Minimal containment under homothetics: a simple cutting plane approach
- Approximate minimum enclosing balls in high dimensions using core-sets
- New Algorithms for k-Center and Extensions
- scientific article; zbMATH DE number 7053357 (Why is no real title available?)
- Algorithm 1024: Spherical Triangle Algorithm: A Fast Oracle for Convex Hull Membership Queries
- Analysis of incomplete data and an intrinsic-dimension Helly theorem
- Approximating global optimum for probabilistic truth discovery
- Polynomial approximate discretization of geometric centers in high-dimensional Euclidean space
- Random Projection and Recovery for High Dimensional Optimization with Arbitrary Outliers
- Minimizing the size of the uncertainty regions for centers of moving entities
- Approximating fair \(k\)-min-sum-radii in Euclidean space
- Parameterized approximation algorithms and lower bounds for k-center clustering and variants
- Efficient subspace approximation algorithms
- Improved linear embeddings via Lagrange duality
- Clustering under perturbation stability in near-linear time
- Hybrid k-clustering: blending k-median and k-center
- Parameterized approximation for robust clustering in discrete geometric spaces
- A faster dual algorithm for the Euclidean minimum covering ball problem
- Clustering with few disks to minimize the sum of radii
- FPT approximation for capacitated sum of radii
- Hybrid k-clustering: blending k-median and k-center
- Approximate maximum rank aggregation: beyond the worst-case
- Clustering in polygonal domains
- FPT approximation for capacitated sum of radii
- Title not available (Why is no real title available?)
- Title not available (Why is no real title available?)
- Title not available (Why is no real title available?)
- Title not available (Why is no real title available?)
- Efficient approximation algorithms for clustering point-sets
- Minimum-volume enclosing ellipsoids and core sets
- Dynamic coresets
- New algorithms for \(k\)-center and extensions
- Small space representations for metric min-sum k-clustering and their applications
This page was built for publication: Approximate clustering via core-sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3579227)
