Statements (23)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:application |
gptkb:Computational_biology
Database theory Fault diagnosis Test case generation |
| gptkbp:defines |
A hitting set for a collection of sets is a set that contains at least one element from each set in the collection.
|
| gptkbp:dualPolyhedron |
gptkb:Set_cover_problem
|
| gptkbp:field |
Computer science
Combinatorics |
| gptkbp:generalizes |
gptkb:Vertex_cover
|
| https://www.w3.org/2000/01/rdf-schema#label |
Hitting Set
|
| gptkbp:NP-complete |
Yes
|
| gptkbp:relatedTo |
gptkb:Set_cover_problem
gptkb:Hypergraph gptkb:Transversal gptkb:Vertex_cover gptkb:Set_theory Minimum hitting set problem |
| gptkbp:studiedBy |
gptkb:Paul_Erdős
gptkb:László_Lovász |
| gptkbp:bfsParent |
gptkb:Karp's_21_NP-complete_problems
gptkb:Reducibility_Among_Combinatorial_Problems_(Karp,_1972) |
| gptkbp:bfsLayer |
6
|