Statements (16)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
mathematical optimization
|
| gptkbp:application |
computational biology
network design |
| gptkbp:approximation |
logarithmic approximation algorithms exist
|
| gptkbp:complexity |
gptkb:NP-hard
|
| gptkbp:definedIn |
undirected graphs
|
| gptkbp:field |
theoretical computer science
graph theory |
| gptkbp:goal |
find minimum-cost tree connecting at least one vertex from each group
|
| https://www.w3.org/2000/01/rdf-schema#label |
group Steiner tree problem
|
| gptkbp:input |
graph
collection of groups of vertices |
| gptkbp:relatedTo |
gptkb:Steiner_tree_problem
|
| gptkbp:studiedBy |
1990s
|
| gptkbp:bfsParent |
gptkb:Steiner_tree_problem
|
| gptkbp:bfsLayer |
7
|