python - Solving minimum set cover using available libraries -

-

i solve instance of minimum set cover. 1 possibility, there way of formulating problem bipartite graph , using networkx?

update using dlx (dancing links) suggested in comments. can give small working example of how solve minimum set cover problem using dlx?

set cover can mapped np-complete problem on graph, doesn't mean you'll able solve efficiently. there reason don't focus directly on problem @ hand (ie, set cover)?

maybe like: pypi.python.org/pypi/dlx

this can installed using: pip install dlx or easy_install dlx


Comments

Post a Comment

Popular posts from this blog

c# - Pausing a storyboard on TabItem mouse over -

-
i have tab control invisible tabs. when mouse on area of form, calls c# handler runs: ((storyboard)findresource("animate")).begin(hiddentab); the animate storyboard: <storyboard x:key="animate"> <objectanimationusingkeyframes begintime="0:0:0" storyboard.targetproperty="visibility"> <discreteobjectkeyframe keytime="0"> <discreteobjectkeyframe.value> <visibility>visible</visibility> </discreteobjectkeyframe.value> </discreteobjectkeyframe> </objectanimationusingkeyframes> <doubleanimation begintime="0:0:0.0" storyboard.targetproperty="opacity" from="0" to="1" duration="0:0:0.2"/> <doubleanimation begintime="0:0:2.5" storyboard.targetproperty="opacity" from="1" to="0...
Read more

mongodb - Struggling to get ordered results from the last retrieved article, given array of elements to search in -

-
i have collections of objects structure this: { "_id" : objectid("5233a700bc7b9f31580a9de0"), "id" : "3df7ce4cc2586c37607a8266093617da", "published_at" : isodate("2013-09-13t23:59:59z"), ... "topic_id" : [ 284, 9741 ], ... "date" : numberlong("1379116800055") } i'm trying use following query: db.collection.find({"topic_id": { $in: [ 9723, 9953, 9558, 9982, 9833, 301, ... 9356, 9990, 9497, 9724] }, "date": { $gte: 1378944001000, $lte: 1378954799000 }, "_id": { $gt: objectid('523104ddbc7b9f023700193c') }}).sort({ "_id": 1 }).limit(1000) the above query uses topic_id, date index not keep order of returned results. forcing use hint({_id:1}) makes results ordered, nscanned 1 million documents though limit(1000) specified. what missing?
Read more

erlang - Saving a digraph to mnesia is hindered because of its side-effects -

-
updated the digraph library in erlang implements data type side-effectful. each operation on data type saves new state in ets table -- instead of returning altered version of itself, more common in functional languages. the problem usage perspective, impedes effort store or pass around state in convenient way requiring me first "collect" state before can start juggle around. the closest solution have seen far serializer/deserializer , these have drawback tied current structure of digraphs instead of operating on abstract type -- prevents future proof solution. update pascal pointed out serializer utilizes interface of digraph, , hence eliminates drawback mentioned above. better, albeit still inconvenient, see no better alternative. what recommendation on how store digraphs? should go different data type altogether? thanks. i not sure understand concern. fact digraph stored in ets transparent in user interface, might want chnge either exchange digr...
Read more