Algorithms in combinatorial geometry
Algorithms in combinatorial geometry
Journal of Algorithms
Optimal partitions having disjoint convex and conic hulls
Mathematical Programming: Series A and B
Enumerating nested and consecutive partitions
Journal of Combinatorial Theory Series A
Discrete Applied Mathematics
The Vector Partition Problem for Convex Objective Functions
Mathematics of Operations Research
A Polynomial Time Algorithm for Shaped Partition Problems
SIAM Journal on Optimization
Some geometric clustering problems
Nordic Journal of Computing
Algorithms for a Set Partitioning Problem Arising in the Design of Multipurpose Units
IEEE Transactions on Computers
Sphere-separable partitions of multi-parameter elements
Discrete Applied Mathematics
Computing a nonnegative matrix factorization -- provably
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Are there more almost separable partitions than separable partitions?
Journal of Combinatorial Optimization
| Hi-index | 0.00 |
Consider partitions of a given set A of n distinct points in general position in 驴 d into parts where each pair of parts can be separated by a hyperplane that contains a given set of points E. We consider the problem of counting and generating all such partitions (correcting a classic 1967 result of Harding about the number of such partitions into two parts). Applications of the result to partition problems are presented.