Max-Min Problems of Searching for Two Disjoint Subsets
From MaRDI portal
Recommendations
- On the complexity of some problems of searching for a family of disjoint clusters
- NP-hardness of some max-min clustering problems
- NP-hardness of some quadratic Euclidean 2-clustering problems
- On the complexity of some quadratic Euclidean 2-clustering problems
- NP-hardness of quadratic Euclidean 1-mean and 1-median 2-clustering problem with constraints on the cluster sizes
Cites work
- A streaming algorithm for 2-center with outliers in high dimensions
- Data mining. The textbook
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- NP-hardness of Euclidean sum-of-squares clustering
- NP-hardness of some max-min clustering problems
- Pattern recognition and machine learning.
- Polynomial-time solvability of the one-dimensional case of an NP-hard clustering problem
- Worst-Case and Probabilistic Analysis of a Geometric Location Problem
Cited in
(8)- NP-hardness of some max-min clustering problems
- On the complexity of some problems of searching for a family of disjoint clusters
- Extracting constrained 2-interval subsets in 2-interval sets
- scientific article; zbMATH DE number 2185638 (Why is no real title available?)
- Maximizing the Number of Nonnegative Subsets
- A 2-approximate algorithm to solve one problem of the family of disjoint vector subsets
- scientific article; zbMATH DE number 1408924 (Why is no real title available?)
- Constant-factor approximation algorithms for some maximin multi-clustering problems
This page was built for publication: Max-Min Problems of Searching for Two Disjoint Subsets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6488359)
