This preview shows page 1. Sign up to view the full content.
Unformatted text preview: 3 4 1 5 2 5 10 5 40 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 dont need to. Node 5 is called a Steiner node. We wish to compute the minimumcost tree that connects the rst four nodes. Note that this need not be a spanning tree of the graph, since the node 5 need not be included. Find the optimal solution, and explain why it is optimal....
View
Full
Document
This note was uploaded on 09/30/2008 for the course ENGRI 1101 taught by Professor Trotter during the Fall '05 term at Cornell University (Engineering School).
 Fall '05
 TROTTER

Click to edit the document details