Worksheet #12 Mat 117
Name........................................
Name........................................
Name........................................
Please show your work clearly and neatly. NO work – NO credit! Your group size may have
AT MOST 3 people. You will lose points if more than three names are on this worksheet.
1. (Pg 398 #17) A person starting in Wichita must visit Kansas City, Omaha, and St.
Louis, and then return home to Wichita in one car trip. The road mileage between the
cities is shown below:
Kansas City Omaha St. Louis Wichita
Kansas City 201 256 190
Omaha 201 449 298
St. Louis 256 449 447
Wichita 190 298 447
(a) Draw a weighted graph corresponding to this situation next to the above chart.
(b) Use the nearest neighbor algorithm to find an approximate solution to the traveling
salesperson problem for a circuit staring at Wichita, and find the length of this circuit.
(c) Use the greedy algorithm to find an approximate solution to the traveling salesperson
problem for a circuit staring at Wichita, and find the length of this circuit.
1
