Pages that link to "Item:Q1982892"
From MaRDI portal
The following pages link to On the complexity of some quadratic Euclidean partition problems into balanced clusters (Q1982892):
Displaying 4 items.
- On the complexity of some Euclidean problems of partitioning a finite set of points (Q521408) (← links)
- NP-hardness of some Euclidean problems of partitioning a finite set of points (Q1662580) (← links)
- Quadratic Euclidean 1-mean and 1-median 2-clustering problem with constraints on the size of the clusters: complexity and approximability (Q2043627) (← links)
- NP-completeness of some problems of partitioning a finite set of points in Euclidean space into balanced clusters (Q2304346) (← links)