1.7.1 Set Cover

Problem Input | Problem Output 


INPUT                    OUTPUT

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

Problem: What is the smallest subset of subsets T \subset S such that \cup_{t_i \in T} t_i = U ?

Implementations

  • Discrete Optimization Methods (Pascal) (rating 5)

    Related Problems

  • Matching
  • Polygon Partitioning
  • Set Data Structures
  • Set Packing
  • Vertex 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 .