scientific article; zbMATH DE number 5764796
From MaRDI portal
Publication:3579385
Cited in
(21)- \(k\)-median/means with outliers revisited: a simple fpt approximation
- Analyzing the optimal neighborhood: algorithms for partial and budgeted connected dominating set problems
- On the cost of essentially fair clusterings
- Local search algorithm for the spherical \(k\)-means problem with outliers
- scientific article; zbMATH DE number 7650100 (Why is no real title available?)
- Approximation algorithms for the covering-type \(k\)-violation linear program
- Approximation and complexity of the capacitated geometric median problem
- A constant approximation for colorful \(k\)-center
- Approximation algorithm for the kinetic robust \(k\)-center problem
- Low rank approximation in the presence of outliers
- An approximation algorithm for the spherical \(k\)-means problem with outliers by local search
- How to find a good explanation for clustering?
- Better guarantees for \(k\)-median with service installation costs
- On some variants of Euclidean \(k\)-supplier
- Data reduction for weighted and outlier-resistant clustering
- Approximation algorithms for the partition vertex cover problem
- Min sum clustering with penalties
- Robust communication-optimal distributed clustering algorithms
- Approximation algorithms for robust clustering problems using local search techniques
- Sampling-based dimension reduction for subspace approximation with outliers
- scientific article; zbMATH DE number 7378621 (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 Q3579385)
