Pages that link to "Item:Q1662580"
From MaRDI portal
The following pages link to NP-hardness of some Euclidean problems of partitioning a finite set of points (Q1662580):
Displaying 7 items.
- On the complexity of some Euclidean optimal summing problems (Q334416) (← links)
- On the complexity of some Euclidean problems of partitioning a finite set of points (Q521408) (← links)
- NP-hardness of some quadratic Euclidean 2-clustering problems (Q906118) (← links)
- On the complexity of some quadratic Euclidean partition problems into balanced clusters (Q1982892) (← links)
- NP-hardness of some max-min clustering problems (Q2026156) (← links)
- NP-completeness of some problems of partitioning a finite set of points in Euclidean space into balanced clusters (Q2304346) (← 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)