A note on the minimum label spanning tree

Authors:
Yingyu Wan;Guoliang Chert;Yinlong Xu
Affiliations:
Department of Computer Science and Technology, University of Science and Technology of China, National High Performance Computing Center at Hefei, Hefei 230027, People's Republic of China;Department of Computer Science and Technology, University of Science and Technology of China, National High Performance Computing Center at Hefei, Hefei 230027, People's Republic of China;Department of Computer Science and Technology, University of Science and Technology of China, National High Performance Computing Center at Hefei, Hefei 230027, People's Republic of China
Venue:
Information Processing Letters
Year:
2002

Citing 3
Cited 16

The minimum labeling spanning trees

Information Processing Letters
A threshold of ln n for approximating set cover

Journal of the ACM (JACM)
On the minimum label spanning tree problem

Information Processing Letters

The labeled perfect matching in bipartite graphs

Information Processing Letters
An effective genetic algorithm for the minimum-label spanning tree problem

Proceedings of the 8th annual conference on Genetic and evolutionary computation
Least and most colored bases

Discrete Applied Mathematics
The labeled maximum matching problem

Computers and Operations Research
Reliable routings in networks with generalized link failure events

IEEE/ACM Transactions on Networking (TON)
A mixed integer linear formulation for the minimum label spanning tree problem

Computers and Operations Research
The labeled perfect matching in bipartite graphs

Information Processing Letters
Variable neighborhood search for the cost constrained minimum label spanning tree and label constrained minimum spanning tree problems

Computers and Operations Research
The parameterized complexity of some minimum label problems

Journal of Computer and System Sciences
Reliable routings in networks with generalized link failure events

NETWORKING'06 Proceedings of the 5th international IFIP-TC6 conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems
On complexity and approximability of the labeled maximum/perfect matching problems

ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Approximation algorithms and hardness results for labeled connectivity problems

MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
A survey of approximation results for local search algorithms

Efficient Approximation and Online Algorithms
Local search for the minimum label spanning tree problem with bounded color classes

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

Operations Research Letters
Comparison of heuristics for the colourful travelling salesman problem

International Journal of Metaheuristics

Quantified Score

Hi-index	0.89

Visualization

Abstract

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 n + 1.