Constant-factor approximation algorithms for some maximin multi-clustering problems
From MaRDI portal
Publication:6134049
Recommendations
- NP-hardness of some max-min clustering problems
- Max-Min Problems of Searching for Two Disjoint Subsets
- On the complexity of some problems of searching for a family of disjoint clusters
- Clustering to minimize the maximum intercluster distance
- NP-hardness of some quadratic Euclidean 2-clustering problems
Cites work
- Algorithms for facility location problems with outliers. (Extended abstract)
- Approximation algorithms for geometric median problems
- Clustering to minimize the maximum intercluster distance
- Exact algorithms of searching for the largest size cluster in two integer 2-clustering problems
- Max-Min Problems of Searching for Two Disjoint Subsets
- NP-hardness of Euclidean sum-of-squares clustering
- On the complexity of some quadratic Euclidean partition problems into balanced clusters
- Outlier analysis
Cited in
(4)- scientific article; zbMATH DE number 6351476 (Why is no real title available?)
- A constant factor approximation algorithm for a class of classification problems
- On the complexity of the problem of choice of large clusters
- An improved approximation algorithm for the metric maximum clustering problem with given cluster sizes
This page was built for publication: Constant-factor approximation algorithms for some maximin multi-clustering problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6134049)
