prelab1 - 11 10 23 22 11 11 1. Find the minimum spanning...

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

View Full Document Right Arrow Icon
ENGRI 115 Engineering Applications of OR Fall 2007 The Minimum Spanning Tree Problem Prelab 1 Name: 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 Prelab Exercise: Please write your answers on the back of this sheet. Consider the following input for the minimum spanning tree problem. 3 4 1 5 2 5 10 5 40
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

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 dont 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

This note was uploaded on 06/01/2008 for the course ENGRI 1101 taught by Professor Trotter during the Fall '05 term at Cornell University (Engineering School).

Ask a homework question - tutors are online