A region contains a number of towns connected by roads. In the graph below, each town...

Transcribed Image Text:

A region contains a number of towns connected by roads. In the graph below, each town is labeled with a circle and each road is labeled with the average number of hours required for a truck to travel between the cities. Suppose that you work for a large retailer that has decided to place a distribution center in town G. (While this problem is small, you want to devise a method to solve much larger problems). C 3 3 D E 2 2 9 7 A 7 B 7 3 F G H 8 3 (d) Now suppose you can build two distribution centers. Where would you place them to minimize the time traveled to the farthest town? Describe an algorithm to solve this problem given an arbitrary road map. (e) In the above graph, what are the "optimal" towns to place the two distribution centers? A region contains a number of towns connected by roads. In the graph below, each town is labeled with a circle and each road is labeled with the average number of hours required for a truck to travel between the cities. Suppose that you work for a large retailer that has decided to place a distribution center in town G. (While this problem is small, you want to devise a method to solve much larger problems). C 3 3 D E 2 2 9 7 A 7 B 7 3 F G H 8 3 (d) Now suppose you can build two distribution centers. Where would you place them to minimize the time traveled to the farthest town? Describe an algorithm to solve this problem given an arbitrary road map. (e) In the above graph, what are the "optimal" towns to place the two distribution centers?