For set covering. Given an instance of I = ( X, F ), X is a finite set, F X a subset of the set, so that every element in X at least belong to an F element, that subset F covering X elements.Set cover problem is to find the subset of X, containing a number of at least a subset of C belongs to F, the C covering all elements in the X.

jihefugai\jihefugai.cpp
.........\readme.txt
jihefugai

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．