{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

PreLab3

# PreLab3 - 3 4 1 5 2 5 10 5 40 11 10 23 22 11 11 1 Find the...

This preview shows page 1. Sign up to view the full content.

ENGRI 1101: Engineering Applications of OR, Fall 2008 1 Prelab 3: The Minimum Spanning Tree Problem Name: Netid: Objectives: Introduce students to the graph theoretic concept of spanning trees. Show three different combinatorial algorithms for solving the minimum spanning tree problem. Demonstrate a practical use of minimum spanning trees. Key Ideas: graph, subgraph, spanning subgraph, connected subgraph, tree, greedy algorithm, minimality, sensitivity analysis Reading Assignment: Read Handout 4 on the minimum spanning tree problem. Prelab exercise: Please write your answer on the back of this sheet. Consider the following input for the minimum spanning tree problem.
This is the end of the preview. Sign up to access the rest of the document.

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 con-nected. 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 node 5 need not be included. Find the optimal solution, and explain why it is optimal....
View Full Document

{[ snackBarMessage ]}