This is equivalent to Minimum Set Cover, which is NP-Complete, but there are good approximation algorithms.
See http://www.nada.kth.se/~viggo/wwwcompendium/node146.html
- [algogeeks] Re: cover problem Gene
- [algogeeks] Re: cover problem sudhakar-aluri
This is equivalent to Minimum Set Cover, which is NP-Complete, but there are good approximation algorithms.
See http://www.nada.kth.se/~viggo/wwwcompendium/node146.html