A note on the minimum label spanning tree
We give a tight analysis of the greedy algorithm introduced by Krumke and Wirth for the minimum label spanning tree problem. The algorithm is shown to be a (In(n - 1) + 1)-approximation for any graph with n nodes (n > 1), which improves the known performance guarantee 2 In n + 1. (C) 2002 Elsevier Science B.V. All rights reserved.
spanning tree network design np-hard approximation algorithms