Info
此问题已关闭。 请重新打开它进行编辑或回答。
How to write a greedy algorithm for this problem?
1 次查看(过去 30 天)
显示 更早的评论
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.
1 个评论
回答(0 个)
此问题已关闭。
另请参阅
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!