Bounds for the travelling salesman problem Quiz
Studying this course? Keep your progress in one place.
Pick an answer for each. Quizzes never use energy.
5 questions, one answer each
Each answer is checked as you go, with why.
See all 5 questions
1. A tour of length is found. The lower bound is . Which statement is correct?
- A. The shortest tour is at least
- B. The shortest tour is exactly
- C. The shortest tour is at most
- D. The shortest tour is between and
2. A nearest neighbour tour from is ---- with arcs , , , . What is the upper bound?
- A.
- B.
- C.
- D.
3. An MST has weight . What upper bound does walking round it give?
- A.
- B.
- C.
- D.
4. To find a lower bound, which arcs at the deleted vertex are added to the MST?
- A. All of them
- B. The longest two
- C. The two shortest
- D. Only the shortest
5. A road network has missing. The routes -- and -- have lengths and . What length is given to in the complete network?
- A.
- B.
- C.
- D.