The following pages link to (Q4873762):
Displaying 12 items.
- Covering a set of points by two axis-parallel boxes (Q294806) (← links)
- Minimum sum of diameters clustering (Q581969) (← links)
- Maximum sum-of-splits clustering (Q583774) (← links)
- Enumeration of the partitions with minimum diameter (Q686476) (← links)
- Computing Euclidean maximum spanning trees (Q911288) (← links)
- Diameter partitioning (Q1076974) (← links)
- Minimizing the sum of diameters efficiently (Q1199831) (← links)
- Cluster analysis and mathematical programming (Q1365055) (← links)
- Computing optimal diameter-bounded polygon partitions (Q1882473) (← links)
- Clustering to minimize the sum of cluster diameters (Q1887718) (← links)
- A parallel algorithm for partitioning a point set to minimize the maximum of diameters (Q5943108) (← links)
- Optimal line bipartitions of point sets (Q6487424) (← links)