HamedKhan
Reputation: 71
Minimum number of groups with recursive grouping a set of objects with their properties
Suppose we have a set of n similar objects having m properties {p1, ..., pm}. We group these items with property p1. Then inside each group, we again group items with property p2. We continue grouping of sub-groups with the next property, recursively. If we want to get the minimum number of groups, we may search it by grouping items with all permutations of properties in O(m!).
Is this problem NP-complete? Is there a well-known problem in computer science similar to this problem? or is there a polynomial time solution to find the best order of properties for partitioning to get minimum number of groups?
Upvotes: 0
Views: 115
Answers (0)
Related Questions
- Number of ways to divide n objects in k groups, such that no group will have fewer objects than previously formed groups?
- Split a set of size N into M groups with minimum difference between sums of these groups
- Algorithm to split set of objects into certain number of groups?
- Partitioning an array to maximal number of groups
- Assign items to a minimal number of groups
- How to find the minimum number of groups needed for grouping a list of elements?
- Most optimal way to combine unique groups of size k from n that meet specific requirements
- Partition a set into k groups with minimum number of moves
- How do I calculate optimal grouping of objects?
- Minimal grouping of objects based on multiple shared property values