How to write a greedy algorithm for this problem?

1 次查看（过去 30 天）

Charles Nelatury 2013-1-18

0
链接

此问题的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/59233-how-to-write-a-greedy-algorithm-for-this-problem

I have a set X which in turn consists of n sets A_i. Each A_i is of different size and each A_i has a value attached to it. I want to partition X into k<n sets B_j where each partition consists of sets A_i which share the same value. k has to be less than n.

I want to use a greedy algorithm to do this but don't know how.