Pages that link to "Item:Q521408"
From MaRDI portal
The following pages link to On the complexity of some Euclidean problems of partitioning a finite set of points (Q521408):
Displaying 10 items.
- On the complexity of some Euclidean optimal summing problems (Q334416) (← links)
- On the complexity and approximability of some Euclidean optimal summing problems (Q506239) (← links)
- NP-hardness of some quadratic Euclidean 2-clustering problems (Q906118) (← links)
- On clustering problems with connected optima in Euclidean spaces (Q1116236) (← links)
- On the complexity of some partition problems (Q1386936) (← 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)
- 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)
- Computing Plurality Points and Condorcet Points in Euclidean Space (Q2872133) (← links)