Pages that link to "Item:Q5943108"
From MaRDI portal
The following pages link to A parallel algorithm for partitioning a point set to minimize the maximum of diameters (Q5943108):
Displaying 6 items.
- Diameter partitioning (Q1076974) (← links)
- Minimizing the sum of diameters efficiently (Q1199831) (← links)
- A parallel algorithm for the conductor of a point set (Q1289527) (← links)
- Computing optimal diameter-bounded polygon partitions (Q1882473) (← links)
- Application of the \texttt{DIRECT} algorithm to searching for an optimal \(k\)-partition of the set \(\mathcal {A}\subset \mathbb {R}^n\) and its application to the multiple circle detection problem (Q2423794) (← links)
- (Q4873762) (← links)
