Pages that link to "Item:Q2026156"
From MaRDI portal
The following pages link to NP-hardness of some max-min clustering problems (Q2026156):
Displaying 6 items.
- NP-hardness of Euclidean sum-of-squares clustering (Q1009338) (← links)
- Norm statistics and the complexity of clustering problems (Q1026145) (← links)
- NP-hard approximation problems in overlapping clustering. (Q1566100) (← links)
- Co-clustering under the maximum norm (Q1736769) (← links)
- Computational complexity of the problem of choosing typical representatives in a 2-clustering of a finite set of points in a metric space (Q5090149) (← links)
- Max-Min Problems of Searching for Two Disjoint Subsets (Q6488359) (← links)