Question 1
The repetitive nearest-neighbor algorithm for solving the Traveling Salesman Problem is
◦ an optimal and inefficient algorithm.
◦ an optimal and efficient algorithm.
◦ an approximate and efficient algorithm.
◦ an approximate and inefficient algorithm.
◦ none of these
Question 2
The Future Laureates is a rock band planning to go on tour across the U.S. using their newly acquired platinum coach tour bus. It turns out their lead guitarist has car sickness. Having already set the dates and venues for the tour, the band wants to minimize their time on the road. A nearest-neighbor tour is found with a total travel time of 126 hours. Suppose that they later find out that the travel time of an optimal tour is 109 hours. What was the relative error of the nearest-neighbor tour? Express your answer as a percentage, rounded to the nearest tenth of a percent.
◦ 5.6%
◦ 13.5%
◦ 24.8%
◦ 15.6%
◦ 17%
Bhimbetka rock painting showing man riding on horse, India
projections of future oil production
Fossils are formed after an animal dies, decomposes, and is covered in sediment. Minerals in ground
Major band of storms
The Rock Cycle