Unformatted text preview: 11 10 23 22 11 11 1. Find the minimum spanning tree in this graph, and give a very simple argument why it is optimal. 2. It turns out that our input was more complicated: only nodes 1 through 4 need to be connected. We may include node 5 if this yields a cheaper solution, but we don’t need to. Node 5 is called a Steiner node. We wish to compute the minimum-cost tree that connects the ﬁrst four nodes. Note that this need not be a spanning tree of the graph, since the new node need not be included. Find the optimal solution, and explain why it is optimal....
View Full Document
- Fall '05
- Minimum Spanning Trees, tree problem