scientific article; zbMATH DE number 7651196
From MaRDI portal
Publication:5874528
Recommendations
Cites work
- A constant-factor approximation algorithm for the \(k\)-median problem
- A local search approximation algorithm for \(k\)-means clustering
- A new greedy approach for facility location problems
- A unified framework for approximating and clustering data
- An Improved Approximation for k -Median and Positive Correlation in Budgeted Optimization
- Approximating \(k\)-median via pseudo-approximation
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Coresets in dynamic geometric data streams
- Decomposable searching problems I. Static-to-dynamic transformation
- Improved Combinatorial Algorithms for Facility Location Problems
- Local Search Heuristics for k-Median and Facility Location Problems
- 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
- Optimal time bounds for approximate clustering
- Smaller coresets for \(k\)-median and \(k\)-means clustering
- Sparsification—a technique for speeding up dynamic graph algorithms
- Unifying and strengthening hardness for dynamic problems via the online matrix-vector multiplication conjecture
Cited in
(7)- On coresets for support vector machines
- Experimental evaluation of fully dynamic \(k\)-means via coresets
- Fully dynamic \(k\)-center clustering with outliers
- Fully dynamic clustering and diversity maximization in doubling metrics
- Exploring Fine-Grained Heterogeneity with Composite Cores
- Fully dynamic \(k\)-center clustering with outliers
- scientific article; zbMATH DE number 1844669 (Why is no real title available?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5874528)
