prize-collecting Steiner tree problem
GPTKB entity
Statements (19)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
mathematical optimization
|
| gptkbp:complexity |
gptkb:NP-hard
|
| gptkbp:estimatedCost |
Goemans-Williamson algorithm
|
| gptkbp:generalizes |
gptkb:Steiner_tree_problem
|
| gptkbp:goal |
find a subtree minimizing edge costs and penalties for excluded vertices
|
| gptkbp:hasApplication |
computational biology
telecommunications network design |
| gptkbp:hasEdgeCost |
each edge has a cost
|
| gptkbp:hasSpecialCase |
node-weighted Steiner tree problem
|
| https://www.w3.org/2000/01/rdf-schema#label |
prize-collecting Steiner tree problem
|
| gptkbp:introduced |
gptkb:David_P._Williamson
Michel X. Goemans |
| gptkbp:introducedIn |
1992
|
| gptkbp:penalty |
each vertex not included incurs a penalty
|
| gptkbp:relatedTo |
gptkb:Steiner_tree_problem
graph theory |
| gptkbp:bfsParent |
gptkb:Steiner_tree_problem
|
| gptkbp:bfsLayer |
7
|