The following pages link to Geometric clusterings (Q3361924):
Displaying 25 items.
- On the number of separable partitions (Q491209) (← links)
- On minimum sum of radii and diameters clustering (Q494937) (← links)
- New local searches for solving the multi-source Weber problem (Q512988) (← links)
- Computing the coarseness with strips or boxes (Q526818) (← links)
- A local search approximation algorithm for \(k\)-means clustering (Q598232) (← links)
- Minimum clique partition in unit disk graphs (Q659693) (← links)
- A faster algorithm for the two-center decision problem (Q685492) (← links)
- Geometric Knapsack problems (Q689105) (← links)
- An approximation algorithm for multidimensional assignment problems minimizing the sum of squared errors (Q1026115) (← links)
- Minimizing the sum of diameters efficiently (Q1199831) (← links)
- Separable partitions (Q1283783) (← links)
- An approximate algorithm for computing multidimensional convex hulls (Q1294388) (← links)
- Cluster analysis and mathematical programming (Q1365055) (← links)
- A randomized approximation scheme for metric MAX-CUT (Q1604207) (← links)
- Geometric clustering in normed planes (Q1631777) (← links)
- Covering points with convex sets of minimum size (Q1705773) (← links)
- Some clustering algorithms in normed planes (Q1792096) (← links)
- Optimal separable partitioning in the plane (Q1893156) (← links)
- Unmanned aerial vehicle set covering problem considering fixed-radius coverage constraint (Q2177831) (← links)
- Minimum perimeter-sum partitions in the plane (Q2291459) (← links)
- Counting disjoint 2-partitions for points in the plane (Q2384393) (← links)
- A weakly robust PTAS for minimum clique partition in unit disk graphs (Q2428685) (← links)
- Three-clustering of points in the plane. (Q2482902) (← links)
- Approximating fair \(k\)-min-sum-radii in Euclidean space (Q6574937) (← links)
- Computing the coarseness measure of a bicolored point set over guillotine partitions (Q6657381) (← links)
