Statements (29)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
theoretical computer science
NP-complete problem |
| gptkbp:application |
information retrieval
bioinformatics resource allocation data mining network design |
| gptkbp:approximation_algorithm |
greedy algorithm
|
| gptkbp:approximation_ratio |
ln(n)
|
| gptkbp:cannot_be_approximated_within |
(1-o(1))·ln(n) unless P=NP
|
| gptkbp:citation |
Karp, R. M. (1972). Reducibility among combinatorial problems.
|
| gptkbp:complexity |
NP-complete
|
| gptkbp:definedIn |
given a universe and a collection of subsets, find the smallest sub-collection whose union covers the universe
|
| gptkbp:field |
gptkb:mathematics
computer science |
| gptkbp:first_formalized_by |
gptkb:Richard_M._Karp
|
| gptkbp:first_formalized_in |
1972
|
| gptkbp:generalizes |
gptkb:vertex_cover_problem
|
| gptkbp:hasSpecialCase |
hitting set problem
|
| https://www.w3.org/2000/01/rdf-schema#label |
Set Cover Problem
|
| gptkbp:input |
collection of subsets
universe of elements |
| gptkbp:output |
smallest sub-collection of subsets covering the universe
|
| gptkbp:relatedTo |
gptkb:vertex_cover_problem
gptkb:set_packing_problem hitting set problem |
| gptkbp:solvable_by |
gptkb:integer_linear_programming
|
| gptkbp:bfsParent |
gptkb:Combinatorial_Optimization
|
| gptkbp:bfsLayer |
6
|