Info
Cette question est clôturée. Rouvrir pour modifier ou répondre.
How to write a greedy algorithm for this problem?
1 vue (au cours des 30 derniers jours)
Afficher commentaires plus anciens
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 commentaire
Réponses (0)
Cette question est clôturée.
Voir également
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!