Solving Minimum Set Cover Using Available Libraries

I would like to solve an instance of minimum set cover. As one possibility, is there some way of formulating the problem as a bipartite graph and using networkx? Update Using dlx (

Solution 1:

For everyone struggling with DLX library in Python, I prepared a little example

install with pip install dlx then do as I specified in my gist, it comes with couple of example instances. Enjoy!

Solution 2:

Set cover can be mapped to any NP-complete problem on a graph, but that doesn't mean you'll be able to solve it efficiently. Is there a reason you don't focus directly on the problem at hand (ie, set cover)?

Maybe something like: https://pypi.org/project/dlx/

This can be installed using: pip install dlx or easy_install dlx