论文信息 - Worst-case behavior of the MVCA heuristic for the minimum labeling spanning tree problem

Worst-case behavior of the MVCA heuristic for the minimum labeling spanning tree problem

In this paper, we review recent work on the minimum labeling spanning tree problem and obtain a new worst-case ratio for the MVCA heuristic. We also present a family of graphs in which the worst-case ratio can be attained. This implies that the new ratio cannot be improved any further.

[1] Guoliang Chen,et al. A note on the minimum label spanning tree , 2002, Inf. Process. Lett..

[2] Ruay-Shiung Chang,et al. The Minimum Labeling Spanning Trees , 1997, Inf. Process. Lett..

[3] Gerhard J. Woeginger,et al. Local search for the minimum label spanning tree problem with bounded color classes , 2003, Oper. Res. Lett..

[4] Sven Oliver Krumke,et al. On the Minimum Label Spanning Tree Problem , 1998, Inf. Process. Lett..