Hitting Set problem
E1466150
UNEXPLORED
The Hitting Set problem is a classic NP-complete combinatorial decision problem that asks whether there exists a small subset of elements that intersects every set in a given collection.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Hitting Set problem canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T21088255 — 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: Hitting Set problem Context triple: [Reducibility Among Combinatorial Problems, establishesNPCompletenessOf, Hitting Set problem]
-
A.
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.
-
B.
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.
-
C.
Boolean satisfiability problem
The Boolean satisfiability problem (SAT) is the canonical NP-complete decision problem of determining whether there exists an assignment of truth values to variables that makes a given Boolean formula evaluate to true.
-
D.
Max-3-SAT
Max-3-SAT is an optimization variant of the Boolean satisfiability problem where the goal is to maximize the number of satisfied clauses, each containing exactly three literals, and it serves as a central problem in the study of approximation algorithms and hardness of approximation.
-
E.
Erdős–Ko–Rado theorem
The Erdős–Ko–Rado theorem is a fundamental result in extremal combinatorics that determines the maximum size of a family of subsets of a finite set in which every pair of subsets has a non-empty intersection.
- 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: Hitting Set problem Target entity description: The Hitting Set problem is a classic NP-complete combinatorial decision problem that asks whether there exists a small subset of elements that intersects every set in a given collection.
-
A.
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.
-
B.
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.
-
C.
Boolean satisfiability problem
The Boolean satisfiability problem (SAT) is the canonical NP-complete decision problem of determining whether there exists an assignment of truth values to variables that makes a given Boolean formula evaluate to true.
-
D.
Max-3-SAT
Max-3-SAT is an optimization variant of the Boolean satisfiability problem where the goal is to maximize the number of satisfied clauses, each containing exactly three literals, and it serves as a central problem in the study of approximation algorithms and hardness of approximation.
-
E.
Erdős–Ko–Rado theorem
The Erdős–Ko–Rado theorem is a fundamental result in extremal combinatorics that determines the maximum size of a family of subsets of a finite set in which every pair of subsets has a non-empty intersection.
- 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)