unweighted set cover problem
GPTKB entity
Statements (23)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
theoretical computer science
|
| gptkbp:application |
gptkb:machine_learning
resource allocation data mining network design |
| gptkbp:approximationAlgorithm |
greedy algorithm
|
| gptkbp:approximationRatio |
O(log n)
|
| gptkbp:complexity |
NP-complete
|
| gptkbp:field |
combinatorial optimization
computer science theoretical computer science |
| gptkbp:goal |
find minimum number of subsets whose union covers the universe
|
| gptkbp:hasSpecialCase |
weighted set cover problem
|
| https://www.w3.org/2000/01/rdf-schema#label |
unweighted set cover problem
|
| gptkbp:input |
collection of subsets
universe of elements |
| gptkbp:relatedTo |
gptkb:vertex_cover_problem
NP-complete problem hitting set problem set cover problem |
| gptkbp:studiedBy |
1970s
|
| gptkbp:bfsParent |
gptkb:Set_cover_problem
|
| gptkbp:bfsLayer |
7
|