Euclidean Steiner tree problem

GPTKB entity

Statements (19)
Predicate Object
gptkbp:instanceOf mathematical optimization problem
gptkbp:application phylogenetics
network design
circuit layout
gptkbp:complexity gptkb:NP-hard
gptkbp:describes The problem of finding the shortest network of lines connecting a given set of points in the Euclidean plane, possibly adding extra points (Steiner points).
gptkbp:field gptkb:geometry
gptkb:mathematics
combinatorial optimization
gptkbp:formedBy 19th century
https://www.w3.org/2000/01/rdf-schema#label Euclidean Steiner tree problem
gptkbp:namedAfter gptkb:Jakob_Steiner
gptkbp:relatedTo gptkb:Steiner_tree_problem
minimum spanning tree
gptkbp:solvedBy heuristics
approximation algorithms
exact algorithms for small instances
gptkbp:bfsParent gptkb:Steiner_tree_problem
gptkbp:bfsLayer 7