Set Cover Problem - Related Problems

Related Problems

  • Hitting set is an equivalent reformulation of Set Cover.
  • Vertex cover is a special case of Hitting Set.
  • Edge cover is a special case of Set Cover.
  • Set packing is the dual problem of Set Cover.
  • Maximum coverage problem is to choose at most k sets to cover as many elements as possible.
  • Dominating set is the problem of selecting a set of vertices (the dominating set) in a graph such that all other vertices are adjacent to at least one vertex in the dominating set. The Dominating set problem was shown NP complete by reducing Set cover to it.
  • Exact cover problem is to choose a set cover with no element included in more than one covering set.

Read more about this topic:  Set Cover Problem

Famous quotes containing the words related and/or problems:

    “Gambling is closely related to theft, and lewdness to murder.”
    —Chinese proverb.

    “Our [adult] children have an adult’s right to make their own choices and have the responsibility of living with the consequences. If we make their problems ours, they avoid that responsibility, and we are faced with problems we can’t and shouldn’t solve.”
    —Jane Adams (20th century)