|
gptkbp:instanceOf
|
mathematical optimization
|
|
gptkbp:application
|
VLSI design
network design
phylogenetic tree construction
|
|
gptkbp:canBe
|
additional non-terminal vertices (Steiner points)
|
|
gptkbp:citation
|
gptkb:Handbook_of_Graph_Theory
gptkb:Combinatorial_Optimization:_Algorithms_and_Complexity_(Papadimitriou_&_Steiglitz)
|
|
gptkbp:complexity
|
gptkb:NP-hard
|
|
gptkbp:estimatedCost
|
yes
|
|
gptkbp:field
|
gptkb:mathematics
computer science
graph theory
|
|
gptkbp:formedBy
|
19th century
|
|
gptkbp:generalizes
|
minimum spanning tree problem
|
|
https://www.w3.org/2000/01/rdf-schema#label
|
Steiner tree problem
|
|
gptkbp:input
|
graph
set of vertices (terminals)
|
|
gptkbp:namedAfter
|
gptkb:Jakob_Steiner
|
|
gptkbp:output
|
minimum-weight tree connecting terminals
|
|
gptkbp:relatedTo
|
gptkb:Steiner_system
minimum spanning tree
|
|
gptkbp:solvedBy
|
heuristics
approximation algorithms
integer programming
|
|
gptkbp:variant
|
gptkb:Euclidean_Steiner_tree_problem
gptkb:directed_Steiner_tree_problem
gptkb:group_Steiner_tree_problem
gptkb:prize-collecting_Steiner_tree_problem
gptkb:rectilinear_Steiner_tree_problem
|
|
gptkbp:bfsParent
|
gptkb:Steinerizer
gptkb:NP_languages
|
|
gptkbp:bfsLayer
|
6
|