A unified framework for clustering constrained data without locality property
From MaRDI portal
Publication:5363012
Recommendations
Cited in
(13)- Learning the truth vector in high dimensions
- Connected \(k\)-center and \(k\)-diameter clustering
- Faster balanced clusterings in high dimension
- Constrained clustering via diagrams: a unified theory and its application to electoral district design
- Improved PTAS for the constrained \(k\)-means problem
- An approximation algorithm for the uniform capacitated \(k\)-means problem
- Faster algorithms for the constrained \(k\)-means problem
- A unified framework of FPT approximation algorithms for clustering problems
- Some Estimates on the Discretization of Geometric Center-Based Problems in High Dimensions
- A unified framework for clustering constrained data without locality property
- Privacy preserving clustering with constraints
- On geometric prototype and applications
- FPT Approximation for Constrained Metric k-Median/Means
This page was built for publication: A unified framework for clustering constrained data without locality property
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5363012)