Statements (24)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
mathematical optimization
|
| gptkbp:application |
coding theory
resource allocation scheduling |
| gptkbp:approximation |
hard to approximate
|
| gptkbp:complexity |
gptkb:NP-hard
|
| gptkbp:defines |
Given a universe and a collection of subsets, find the largest subcollection of pairwise disjoint subsets.
|
| gptkbp:field |
gptkb:mathematics
computer science |
| gptkbp:hasSpecialCase |
gptkb:maximum_clique_problem
|
| gptkbp:hasUnweightedVersion |
unweighted set packing problem
|
| gptkbp:hasWeightedVersion |
weighted set packing problem
|
| https://www.w3.org/2000/01/rdf-schema#label |
set packing problem
|
| gptkbp:input |
finite set
collection of subsets |
| gptkbp:relatedTo |
maximum independent set problem
set cover problem |
| gptkbp:solvedBy |
integer programming
greedy algorithms branch and bound |
| gptkbp:studiedBy |
1970s
|
| gptkbp:bfsParent |
gptkb:Set_cover_problem
gptkb:Set_Cover_Problem |
| gptkbp:bfsLayer |
7
|