Performance Analysis on Evolutionary Algorithms for the Minimum Label Spanning Tree Problem

no code implementations • 3 Sep 2014 • Xinsheng Lai, Yuren Zhou, Jun He, Jun Zhang

We also show that GSEMO achieves a $(2ln(n))$-approximation ratio for the MLST problem in expected polynomial time of $n$ and $k$.

Evolutionary Algorithms