Thinking Mathematically (6th Edition)

Published by Pearson
ISBN 10: 0321867327
ISBN 13: 978-0-32186-732-2

Chapter 14 - Graph Theory - 14.4 Trees - Exercise Set 14.4 - Page 933: 55


The statement makes sense.

Work Step by Step

The statement makes sense. Finding the Hamilton circuit for which the sum of the weights is a minimum can require huge amounts of calculations. The Nearest Neighbor Method is a relatively quick method which helps us find a Hamilton circuit in the graph which approximates the optimal solution. Sometimes the Nearest Neighbor Method gives us the optimal solution but the method does not always give us the optimal solution. However, Kruskal's Algorithm always gives the minimum spanning tree in a graph. That is, using Kruskal's Algorithm, we can always find the spanning tree with the smallest possible total weight.
Update this answer!

You can help us out by revising, improving and updating this answer.

Update this answer

After you claim an answer you’ll have 24 hours to send in a draft. An editor will review the submission and either publish your submission or provide feedback.