The following pages link to Diameter partitioning (Q1076974):
Displaying 15 items.
- New algorithms for \(k\)-center and extensions (Q849133) (← links)
- Computing Euclidean maximum spanning trees (Q911288) (← links)
- Algorithms for high dimensional stabbing problems (Q916570) (← links)
- Minimizing the sum of diameters efficiently (Q1199831) (← links)
- Geometric clustering in normed planes (Q1631777) (← links)
- Some clustering algorithms in normed planes (Q1792096) (← links)
- Polyhedral line transversals in space (Q1822999) (← links)
- Computing grasp functions (Q1917051) (← links)
- EFFICIENT PARALLEL RANGE SEARCHING AND PARTITIONING ALGORITHMS* (Q2755583) (← links)
- A novel dynamic minimum spanning tree based clustering method for image mining (Q2895977) (← links)
- OPTIMAL LINE BIPARTITIONS OF POINT SETS (Q4513232) (← links)
- FREE-FORM SURFACE PARTITION IN 3-D (Q4650082) (← links)
- New Algorithms for k-Center and Extensions (Q5505644) (← 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)
