| Name : perl-Algorithm-SetCovering
| |
| Version : 0.05
| Vendor : obs://build_opensuse_org/devel:languages:perl
|
| Release : lp155.8.1
| Date : 2023-07-20 18:32:01
|
| Group : Development/Libraries/Perl
| Source RPM : perl-Algorithm-SetCovering-0.05-lp155.8.1.src.rpm
|
| Size : 0.02 MB
| |
| Packager : https://www_suse_com/
| |
| Summary : Algorithms to solve the \"set covering problem\"
|
Description :
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), the task is
to find a minimal set of keys to accomplish this. In the example above, the
set [key4, key5] fulfils that condition.
The underlying problem is called \"set covering problem\" and the
corresponding decision problem is NP-complete.
|
RPM found in directory: /packages/linux-pbone/ftp5.gwdg.de/pub/opensuse/repositories/devel:/languages:/perl:/CPAN-A/15.5/noarch |
