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

DOI10.1145/3299904.3340314zbMath1433.68652MaRDI QIDQ5215487

Frank Neumann, Jianxin Wang, 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 algorithm; minimum spanning tree; runtime analysis; \((1,2)\)-minimum spanning tree; depth-restricted \((1,2)\)

Mathematics Subject Classification ID

68W40: Analysis of algorithms

68W50: Evolutionary algorithms, genetic algorithms (computational aspects)

90C59: Approximation methods and heuristics in mathematical programming