Sphere-separable partitions of multi-parameter elements
From MaRDI portal
Publication:2478428
Recommendations
Cites Work
- A Polynomial Time Algorithm for Shaped Partition Problems
- Approximation algorithms for the metric maximum clustering problem with given cluster sizes.
- Directional-Quasi-Convexity, Asymmetric Schur-Convexity and Optimality of Consecutive Partitions
- Enumerating nested and consecutive partitions
- On Grouping for Maximum Homogeneity
- On clustering problems with connected optima in Euclidean spaces
- Optimal partitions having disjoint convex and conic hulls
- Optimality of Nested Partitions and Its Application to Cluster Analysis
- Separable partitions
- Sortability of vector partitions
- The vector partition problem for convex objective functions.
- Vertex characterization of partition polytopes of bipartitions and of planar point sets
Cited In (3)
This page was built for publication: Sphere-separable partitions of multi-parameter elements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2478428)