Set Packing problem
E1466153
UNEXPLORED
The Set Packing problem is a classic NP-complete combinatorial optimization problem that asks for the largest collection of pairwise disjoint sets from a given family of sets.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Set Packing problem canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T21088260 — 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 Packing problem Context triple: [Reducibility Among Combinatorial Problems, establishesNPCompletenessOf, Set Packing 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.
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.
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.
-
D.
A Combinatorial Problem
"A Combinatorial Problem" is a classic mathematical paper by N. G. de Bruijn that introduces and analyzes a fundamental counting problem in combinatorics.
-
E.
Combinatorial Optimization: Algorithms and Complexity
Combinatorial Optimization: Algorithms and Complexity is a foundational textbook that systematically develops the theory and algorithms of combinatorial optimization, emphasizing computational complexity and algorithmic efficiency.
- 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 Packing problem Target entity description: The Set Packing problem is a classic NP-complete combinatorial optimization problem that asks for the largest collection of pairwise disjoint sets from a given family of sets.
-
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.
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.
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.
-
D.
A Combinatorial Problem
"A Combinatorial Problem" is a classic mathematical paper by N. G. de Bruijn that introduces and analyzes a fundamental counting problem in combinatorics.
-
E.
Combinatorial Optimization: Algorithms and Complexity
Combinatorial Optimization: Algorithms and Complexity is a foundational textbook that systematically develops the theory and algorithms of combinatorial optimization, emphasizing computational complexity and algorithmic efficiency.
- 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)