1.7.2 Set Packing

Problem Input | Problem Output 


INPUT                    OUTPUT

Input Description: A set of subsets S = S_1, ..., S_m of the universal set U = \{1,...,n\} .

Problem: What is the largest number of mutually disjoint subsets from S ?

Implementations

  • Discrete Optimization Methods (Pascal) (rating 5)

    Related Problems

  • Bin Packing
  • Independent Set
  • Set Cover

    Go to the corresponding chapter in the book
    About the Book
    Send us Mail
    Go to Main Page

    This page last modified on Tue Jun 03, 1997 .