Unformatted text preview: include DallasSt. Louis(length 600). Next include DallasPhoenix(length 900). Next include PhoenixLA (length 400. Finally include Salt Lake CityLos Angeles (length 600). Total length of minimum spanning tree is 4300 miles. 4. Solution: First we can find the minimum spanning tree of the graph: Add edges (1,2), (10,11), (9,12), (11,12), (8,11), (4,5), (6,9), (1,4), (3,6), (5,8), (7,10) in turn, we get a minimum spanning tree. So, since the unique path given by the minimum spanning tree is a minmax path of the pair of node. So, the path from node 1 to node 12, minimize the maximum altitude is 1>4>5>8>11>12....
View
Full
Document
This note was uploaded on 12/18/2008 for the course IEOR 41033 taught by Professor Adler during the Spring '08 term at Berkeley.
 Spring '08
 ADLER
 Operations Research

Click to edit the document details