|
|
| The stupid question is the question not asked | |
| PerlMonks |
Re: Contemplating some set comparison tasksby hexcoder (Curate) |
| on Aug 09, 2014 at 10:29 UTC ( [id://1096833]=note: print w/replies, xml ) | Need Help?? |
|
Hello, I have no idea how efficient data bases are wrt set covering, but if you want to try within Perl, there is a CPAN module using the 'greedy algorithm' (which does a pretty good approximation of the optimal set cover).
In Section
Meditations
|
|
||||||||||||||||||||||||||||||||||