Runtime analysis of evolutionary algorithms for the depth restricted (1,2)-minimum spanning tree problem

DOI10.1145/3299904.3340314zbMath1433.68652OpenAlexW2969834682MaRDI QIDQ5215487

Jianxin Wang, Frank Neumann, Feng Shi

Publication date: 11 February 2020

Published in: Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3299904.3340314

zbMATH Keywords

evolutionary algorithmminimum spanning treeruntime analysis\((1,2)\)-minimum spanning treedepth-restricted \((1,2)\)

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

Time complexity analysis of evolutionary algorithms for 2-hop \((1,2)\)-minimum spanning tree problem