How is a minimum bottleneck spanning tree different from a minimum spanning tree?
Look at the MST example on Wikipedia for reference: A bottleneck in a spanning tree is a maximum-weight edge in that tree. There may be several bottlenecks (all of the same weight of course) in a spanning tree. In the Wikipedia MST there are two bottlenecks of weight 8. Now, take a minimum spanning tree … Read more