Set Covering problem
E1466146
UNEXPLORED
The Set Covering problem is a classic NP-complete combinatorial optimization problem that asks for the smallest collection of sets whose union covers all elements in a given universe.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Set Covering problem canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T21088249 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Set Covering problem Context triple: [Reducibility Among Combinatorial Problems, establishesNPCompletenessOf, Set Covering problem]
-
A.
Packing and Covering
"Packing and Covering" is a classic mathematical monograph by C. A. Rogers that systematically develops the theory of packing and covering problems in geometry and number theory.
-
B.
Clique problem
The Clique problem is a classic NP-complete decision problem in graph theory that asks whether a graph contains a fully connected subgraph (clique) of at least a given size.
-
C.
Subset sum problem
The subset sum problem is a classic NP-complete decision problem in computer science that asks whether any subset of given integers sums to a specified target value.
-
D.
Cover’s theorem
Cover’s theorem is a result in statistical pattern recognition stating that data cast nonlinearly into a higher-dimensional space is more likely to be linearly separable than in a lower-dimensional space.
-
E.
Steiner tree problem
The Steiner tree problem is a classic optimization problem in combinatorial mathematics and computer science that seeks the shortest network of line segments connecting a given set of points, potentially adding extra intermediate points to minimize total length.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Set Covering problem Target entity description: The Set Covering problem is a classic NP-complete combinatorial optimization problem that asks for the smallest collection of sets whose union covers all elements in a given universe.
-
A.
Packing and Covering
"Packing and Covering" is a classic mathematical monograph by C. A. Rogers that systematically develops the theory of packing and covering problems in geometry and number theory.
-
B.
Clique problem
The Clique problem is a classic NP-complete decision problem in graph theory that asks whether a graph contains a fully connected subgraph (clique) of at least a given size.
-
C.
Subset sum problem
The subset sum problem is a classic NP-complete decision problem in computer science that asks whether any subset of given integers sums to a specified target value.
-
D.
Cover’s theorem
Cover’s theorem is a result in statistical pattern recognition stating that data cast nonlinearly into a higher-dimensional space is more likely to be linearly separable than in a lower-dimensional space.
-
E.
Steiner tree problem
The Steiner tree problem is a classic optimization problem in combinatorial mathematics and computer science that seeks the shortest network of line segments connecting a given set of points, potentially adding extra intermediate points to minimize total length.
- F. None of above. chosen
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.
subject linked to:
"Reducibility Among Combinatorial Problems" (1972)