scientific article; zbMATH DE number 5764796
From MaRDI portal
Publication:3579385
zbMATH Open1192.68881MaRDI QIDQ3579385FDOQ3579385
Authors: Ke Chen 
Publication date: 6 August 2010
Title of this publication is not available (Why is that?)
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Approximation algorithms (68W25)
Cited In (22)
- Analyzing the optimal neighborhood: algorithms for partial and budgeted connected dominating set problems
- Low rank approximation in the presence of outliers
- Title not available (Why is that?)
- Approximation algorithms for the covering-type \(k\)-violation linear program
- Title not available (Why is that?)
- Approximation and complexity of the capacitated geometric median problem
- Min sum clustering with penalties
- Approximation algorithm for the kinetic robust \(k\)-center problem
- \(k\)-median/means with outliers revisited: a simple fpt approximation
- Matroid and knapsack center problems
- Title not available (Why is that?)
- On the cost of essentially fair clusterings
- Approximation algorithms for the partition vertex cover problem
- Local search algorithm for the spherical \(k\)-means problem with outliers
- On some variants of Euclidean \(k\)-supplier
- How to find a good explanation for clustering?
- Approximation algorithms for robust clustering problems using local search techniques
- Title not available (Why is that?)
- Data reduction for weighted and outlier-resistant clustering
- Sampling-based dimension reduction for subspace approximation with outliers
- An approximation algorithm for the spherical \(k\)-means problem with outliers by local search
- Better guarantees for \(k\)-median with service installation costs
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)
