Parameterized approximation for robust clustering in discrete geometric spaces
From MaRDI portal
Cites work
- A Best Possible Heuristic for the k-Center Problem
- A local search approximation algorithm for \(k\)-means clustering
- A new coreset framework for clustering
- A plant location guide for the unsure: approximation algorithms for min-Max location problems
- A refined approximation for Euclidean \(k\)-means
- An Improved Approximation for k -Median and Positive Correlation in Budgeted Optimization
- Approximate clustering via core-sets
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Better guarantees for k-means and euclidean k-median by primal-dual algorithms
- Clustering large graphs via the singular value decomposition
- Explicit, almost optimal, epsilon-balanced codes
- scientific article; zbMATH DE number 7561535 (Why is no real title available?)
- scientific article; zbMATH DE number 7788494 (Why is no real title available?)
- Improved approximations for Euclidean k -means and k -median, via nested quasi-independent sets
- Inapproximability of clustering in Lp metrics
- Johnson coverage hypothesis: inapproximability of k-means and k-median in _p-metrics
- Linear-time approximation schemes for clustering problems in any dimensions
- New approximability results for the robust k-median problem
- On coresets for k-means and k-median clustering
- Parameterized algorithms
- Parameterized approximation schemes for clustering with general norm objectives
- Strong coresets for k-median and subspace approximation: goodbye dimension
- The Euclidean k-supplier problem
- Tight FPT approximation for socially fair clustering
Cited in
(3)
This page was built for publication: Parameterized approximation for robust clustering in discrete geometric spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6875209)
