Example: quiz answers

Chapter 10

A spanning tree is constructed by deleting edges from a tour. Thus, an optimal tour has more weight than the minimum-spanning tree, which means that the weight of the minimum spanning tree forms a lower bound on the weight of an optimal tour. c(t) ≤ c(H*). 10.2

Tags:

  Spanning

Information

Domain:

Source:

Link to this page:

Please notify us if you found a problem with this document:

Other abuse

Related search queries