Learn More
An instance of the Steiner tree problem consists of: 1. A graph) , (E V G , where V is a set of vertices (or nodes) and V V E × ⊂ is a set of edges. 2. A weight associated with each edge, where the weight is a mapping, 3. A set of terminal nodes, V T ⊆. The problem is to compute a minimum Steiner tree, i.e. an acyclic subset) , (S S E V S of G , with , S V(More)
  • 1