Statements (34)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
theoretical computer science
NP-complete problem |
| gptkbp:approximationRatio |
ln(n)
|
| gptkbp:category |
mathematical optimization
covering problem |
| gptkbp:complexity |
NP-complete
|
| gptkbp:definedIn |
Given a universe and a collection of its subsets, find the smallest sub-collection whose union is the universe.
|
| gptkbp:describedYear |
1972
|
| gptkbp:estimatedCost |
greedy algorithm
|
| gptkbp:field |
gptkb:mathematics
computer science |
| gptkbp:firstDescribed |
gptkb:Richard_Karp
gptkb:Karp's_21_NP-complete_problems |
| gptkbp:generalizes |
vertex cover
|
| gptkbp:hardnessOfApproximation |
cannot be approximated within (1-o(1)) ln n unless P=NP
|
| gptkbp:hasSpecialCase |
hitting set
set packing (dual problem) |
| gptkbp:hasVersion |
Does there exist a cover of size k?
|
| https://www.w3.org/2000/01/rdf-schema#label |
Set Cover
|
| gptkbp:input |
collection of subsets
universe of elements |
| gptkbp:output |
smallest sub-collection covering the universe
|
| gptkbp:relatedTo |
combinatorics
optimization vertex cover approximation algorithm hitting set |
| gptkbp:usedIn |
gptkb:machine_learning
bioinformatics resource allocation data mining network design |
| gptkbp:bfsParent |
gptkb:Reducibility_Among_Combinatorial_Problems_(Karp,_1972)
|
| gptkbp:bfsLayer |
6
|