directed Steiner tree problem
GPTKB entity
Statements (18)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
theoretical computer science
|
| gptkbp:complexity |
gptkb:NP-hard
|
| gptkbp:estimatedCost |
yes
|
| gptkbp:field |
computer science
graph theory |
| gptkbp:goal |
find minimum-cost subgraph connecting terminals
|
| gptkbp:hasExactAlgorithm |
yes
|
| https://www.w3.org/2000/01/rdf-schema#label |
directed Steiner tree problem
|
| gptkbp:input |
graph
set of terminal vertices |
| gptkbp:relatedTo |
gptkb:Steiner_tree_problem
network design |
| gptkbp:studiedBy |
1980s
|
| gptkbp:usedIn |
computational biology
network routing VLSI design |
| gptkbp:bfsParent |
gptkb:Steiner_tree_problem
|
| gptkbp:bfsLayer |
7
|