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 (ln(n - 1) + 1)-approximation for any graph with n nodes (n < 1), which improves the known performance guarantee 2 ln n + 1.
[1] Ruay-Shiung Chang,et al. The Minimum Labeling Spanning Trees , 1997, Inf. Process. Lett..
[2] Sven Oliver Krumke,et al. On the Minimum Label Spanning Tree Problem , 1998, Inf. Process. Lett..