Pages that link to "Item:Q1199831"
From MaRDI portal
The following pages link to Minimizing the sum of diameters efficiently (Q1199831):
Displaying 10 items.
- Diameter partitioning (Q1076974) (← links)
- Improved algorithms for uniform partitions of points (Q1348950) (← links)
- Cluster analysis and mathematical programming (Q1365055) (← links)
- Covering points with convex sets of minimum size (Q1705773) (← links)
- Computing grasp functions (Q1917051) (← links)
- Maximizing the ratio of cluster split to cluster diameter without and with cardinality constraints (Q2072077) (← links)
- Minimum perimeter-sum partitions in the plane (Q2291459) (← links)
- Three-clustering of points in the plane. (Q2482902) (← links)
- (Q5369529) (← links)
- A parallel algorithm for partitioning a point set to minimize the maximum of diameters (Q5943108) (← links)