6 citations · 6 across the 1 of their papers we have counts for
1 paper
David Kordalewski
The Set Cover problem (SCP) and Set Packing problem (SPP) are standard NP-hard combinatorial optimization problems. Their decision problem versions are shown to be NP-Complete in K…