Algorithm::SetCovering - Algorithms to solve the "set covering problem" River stage zero No dependents

Consider having M keys and N locks. Every key opens one or more locks: | lock1 lock2 lock3 lock4 -----+------------------------ key1 | x x key2 | x x key3 | x x x key4 | x x key5 | x x Given an arbitrary set of locks you have to open (e.g. 2,3,4), th...

MSCHILLI/Algorithm-SetCovering-0.05 - 05 Dec 2003 07:57:15 UTC

1 result (0.039 seconds)