Suppose that the edges in an undirected graph G satisfy the triangle inequality: cu,v + cv,w

Question:

Suppose that the edges in an undirected graph G satisfy the triangle inequality: cu,v + cv,w ≥ cu,w. Show how to compute a traveling salesman tour of cost at most twice optimal.
Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  book-img-for-question
Question Posted: