Given a set S of integers, the task is to partition the set into subsets such that:
- Total number of partitions is maximized
- Each partition has sum at least K
This looks like a variant of bin-packing problem, in which the bin has to filled upto a minimum capacity and the objective is to maximize the number of bins. I looked up the solutions of bin-packing problem, turned out ffd was the best approximation solution to it.
Could someone please tell me how to approach the partition problem?