Time complexity analysis of evolutionary algorithms for 2-hop \((1,2)\)-minimum spanning tree problem
type: Item
instance of: scholarly article
title: Time complexity analysis of evolutionary algorithms for 2-hop \((1,2)\)-minimum spanning tree problem
author: Feng Shi
author: F. Neumann
author: Jianxin Wang
published in: Theoretical Computer Science
publication date: 2021-11-01T00:00:00Z
full work available at URL: https://arxiv.org/abs/2110.04701
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7417744
zbMATH Keywords: 2-hop \((1, 2)\)-minimum spanning tree
zbMATH Keywords: evolutionary algorithm
zbMATH Keywords: runtime analysis
MaRDI profile type: MaRDI publication profile
OpenAlex ID: W3196685769
Wikidata QID: Q114826278
cites work: On the approximation ability of evolutionary optimization with application to minimum set cover
cites work: Fixed-parameter evolutionary algorithms and the vertex cover problem
cites work: Approximating vertex cover using edge-based representations
cites work: On the Use of the Dual Formulation for Minimum Weighted Vertex Cover in Evolutionary Algorithms
cites work: Runtime performances of randomized search heuristics for the dynamic weighted vertex cover problem
cites work: Foundations of Genetic Algorithms
cites work: Analysis of Solution Quality of a Multiobjective Optimization-Based Evolutionary Algorithm for Knapsack Problem
cites work: Analysis of the \((1 + 1)\) EA on subclasses of linear functions under uniform and linear constraints
cites work: STACS 2005
cites work: Performance analysis of the \((1+1)\) evolutionary algorithm for the multiprocessor scheduling problem
cites work: Artificial immune systems can find arbitrarily good approximations for the NP-hard number partitioning problem
cites work: Randomized local search, evolutionary algorithms, and the minimum spanning tree problem
cites work: Minimum spanning trees made easier via multi-objective optimization
cites work: On the shortest spanning subtree of a graph and the traveling salesman problem
cites work: On the size of weights in randomized search heuristics
cites work: Q4393480
cites work: Parameterized Algorithms
cites work: Expected runtimes of a simple evolutionary algorithm for the multi-objective minimum spanning tree problem
cites work: Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem
cites work: The 2-hop spanning tree problem
cites work: Approximating \(k\)-hop minimum-spanning trees
cites work: Greedy Strikes Back: Improved Facility Location Algorithms
cites work: The Steiner problem with edge lengths 1 and 2
cites work: The Traveling Salesman Problem with Distances One and Two
cites work: 8/7-approximation algorithm for (1,2)-TSP
cites work: Approximating the Pareto curve with local search for the bicriteria TSP(1,2) problem
cites work: Approximation algorithms for the 2-peripatetic salesman problem with edge weights 1 and 2
cites work: Runtime analysis of evolutionary algorithms for the depth restricted (1,2)-minimum spanning tree problem
cites work: Reoptimization time analysis of evolutionary algorithms on linear functions under dynamic uniform constraints
cites work: Multiplicative drift analysis
cites work: A study of drift analysis for estimating computation time of evolutionary algorithms
DOI: 10.1016/J.TCS.2021.09.003
Recommended article: Runtime analysis of evolutionary algorithms for the depth restricted (1,2)-minimum spanning tree problem
Recommended article: Expected runtimes of a simple evolutionary algorithm for the multi-objective minimum spanning tree problem
Recommended article: On the analysis of the (1+1) evolutionary algorithm for the maximum leaf spanning tree problem
Recommended article: Randomized local search, evolutionary algorithms, and the minimum spanning tree problem
Recommended article: A hybrid evolutionary algorithm for the capacitated minimum spanning tree problem
Recommended article: Q5493043
Recommended article: Q5447838
description: scientific article; zbMATH DE number 7417744