Info
Diese Frage ist geschlossen. Öffnen Sie sie erneut, um sie zu bearbeiten oder zu beantworten.
How to write a greedy algorithm for this problem?
1 Ansicht (letzte 30 Tage)
Ältere Kommentare anzeigen
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 Kommentar
Antworten (0)
Diese Frage ist geschlossen.
Siehe auch
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!