Pages that link to "Item:Q2304346"
From MaRDI portal
The following pages link to NP-completeness of some problems of partitioning a finite set of points in Euclidean space into balanced clusters (Q2304346):
Displaying 5 items.
- On the complexity of some Euclidean problems of partitioning a finite set of points (Q521408) (← links)
- On the nearest product of partitions (Q808258) (← links)
- Hexagonal unit network - a tool for proving the NP-completeness results of geometric problems (Q1071507) (← links)
- NP-hardness of some Euclidean problems of partitioning a finite set of points (Q1662580) (← links)
- On the complexity of some quadratic Euclidean partition problems into balanced clusters (Q1982892) (← links)