Pages that link to "Item:Q5060119"
From MaRDI portal
The following pages link to Static and dynamic algorithms for k-point clustering problems (Q5060119):
Displayed 9 items.
- Optimal placement of convex polygons to maximize point containment (Q1265324) (← links)
- Iterated nearest neighbors and finding minimal polytopes (Q1327455) (← links)
- Computing the smallest \(k\)-enclosing circle and related problems (Q1328752) (← links)
- Dynamic Euclidean minimum spanning trees and extrema of binary functions (Q1346130) (← links)
- Faster geometric \(k\)-point MST approximation (Q1370933) (← links)
- Compact location problems (Q1391322) (← links)
- Polynomial time algorithms for three-label point labeling. (Q1401261) (← links)
- A near-linear algorithm for the planar segment-center problem (Q1816414) (← links)
- On geometric optimization with few violated constraints (Q1906043) (← links)