|
From: | Raphael Clifford |
Subject: | [igraph] set cover |
Date: | Tue, 24 Sep 2013 16:31:52 +0100 |
I would like to solve an instance of minimum set cover. Is there some way to do this by formulating it the problem as a bipartite graph and using igraph? Raphael
[Prev in Thread] | Current Thread | [Next in Thread] |