set cover
Description: Set cover is a combinatorial optimization problem of selecting the fewest sets whose union contains every element in a given collection.
Primary topic: Complexity and Algorithms in Graphs (40%)
Wikidata ID: wiki/Q1192100
OpenAlex ID: keywords/set-cover
