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

DOI10.1145/3299904.3340314zbMATH Open1433.68652OpenAlexW2969834682MaRDI QIDQ5215487FDOQ5215487

Authors: Feng Shi, F. Neumann, Jianxin Wang 

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

Recommendations

• Time complexity analysis of evolutionary algorithms for 2-hop \((1,2)\)-minimum spanning tree problem
• Expected runtimes of a simple evolutionary algorithm for the multi-objective minimum spanning tree problem
• Evolutionary computation in combinatorial optimization
• On the analysis of the \((1+1)\) evolutionary algorithm for the maximum leaf spanning tree problem
• Randomized local search, evolutionary algorithms, and the minimum spanning tree problem

zbMATH Keywords

minimum spanning treeevolutionary algorithmruntime analysis\((1,2)\)-minimum spanning treedepth-restricted \((1,2)\)

Mathematics Subject Classification ID

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

Cited In (7)

• On the approximation ability of evolutionary optimization with application to minimum set cover
• Randomized local search, evolutionary algorithms, and the minimum spanning tree problem
• Expected runtimes of a simple evolutionary algorithm for the multi-objective minimum spanning tree problem
• Evolutionary computation in combinatorial optimization
• On the approximability of the fixed-tree balanced minimum evolution problem
• Time complexity analysis of evolutionary algorithms for 2-hop \((1,2)\)-minimum spanning tree problem
• On the analysis of the \((1+1)\) evolutionary algorithm for the maximum leaf spanning tree problem

This page was built for publication: Runtime analysis of evolutionary algorithms for the depth restricted \((1,2)\)-minimum spanning tree problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5215487)