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:

    “So-called “austerity,” the stoic injunction, is the path towards universal destruction. It is the old, the fatal, competitive path. “Pull in your belt” is a slogan closely related to “gird up your loins,” or the guns-butter metaphor.”
    —Wyndham Lewis (1882–1957)

    “The problems of all of humanity can only be solved by all of humanity.”
    —Friedrich Dürrenmatt (1921–1990)