Set cover problem

Rarity: Common

The most frequent rarity: most Wikipedia articles become Commons.

Rarity follows how well known the article is: its views on the French and English Wikipedia over a year, and the number of languages it exists in.

At a glance

Class

Notion

Domain

Science and technology

In collections

Nobody has pulled it yet.

What Wikipedia says

The set cover problem is a classical question in combinatorics, computer science, operations research, and complexity theory.

Excerpt from the Wikipedia article “Set cover problem”, under the CC BY-SA 4.0 license. Read the article on Wikipedia

Image: Jochen Burghardt, CC BY-SA 4.0, via Wikimedia Commons.