vertex cover problem (optimization version)
GPTKB entity
Statements (23)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
theoretical computer science
mathematical optimization |
| gptkbp:application |
network security
bioinformatics resource allocation |
| gptkbp:approximation |
2-approximation algorithm exists
|
| gptkbp:approximationRatio |
2
|
| gptkbp:complexity |
gptkb:NP-hard
fixed-parameter tractable |
| gptkbp:definedIn |
graph
|
| gptkbp:hasExactAlgorithm |
exponential time
|
| https://www.w3.org/2000/01/rdf-schema#label |
vertex cover problem (optimization version)
|
| gptkbp:input |
graph
|
| gptkbp:NP-hardness |
gptkb:NP-hard
|
| gptkbp:objective |
find smallest vertex cover
|
| gptkbp:output |
minimum vertex cover
|
| gptkbp:relatedTo |
gptkb:clique_problem
gptkb:independent_set_problem set cover problem vertex cover problem (decision version) |
| gptkbp:studiedBy |
1970s
|
| gptkbp:bfsParent |
gptkb:NP-hard_problems
|
| gptkbp:bfsLayer |
7
|