On the analysis of the (1+1) evolutionary algorithm for the maximum leaf spanning tree problem

DOI10.1080/00207160.2014.964695zbMath1325.90079OpenAlexW2014607175MaRDI QIDQ3451414

Yuren Zhou, Xinsheng Lai, Xiaoyun Xia

Publication date: 16 November 2015

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160.2014.964695

zbMATH Keywords

local searchperformance analysisevolutionary algorithmapproximation algorithmsmaximum leaf spanning tree

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Randomized algorithms (68W20)

Related Items (1)

Connected domination in maximal outerplanar graphs

Cites Work

• Unnamed Item
• Unnamed Item
• On the approximation ability of evolutionary optimization with application to minimum set cover
• Bioinspired computation in combinatorial optimization. Algorithms and their computational complexity
• The complexity ecology of parameters: An illustration using bounded max leaf number
• Arbres avec un nombre maximum de sommets pendants
• A comparative runtime analysis of heuristic algorithms for satisfiability problems
• Randomized local search, evolutionary algorithms, and the minimum spanning tree problem
• Variations of the maximum leaf spanning tree problem for bipartite graphs
• Constructing full spanning trees for cubic graphs
• An exact algorithm for the maximum leaf spanning tree problem.
• On the analysis of the \((1+1)\) evolutionary algorithm
• Spanning trees with many leaves in cubic graphs
• Approximating Maximum Leaf Spanning Trees in Almost Linear Time

This page was built for publication: On the analysis of the (1+1) evolutionary algorithm for the maximum leaf spanning tree problem