Time Complexity Analysis of Evolutionary Algorithms for 2-Hop (1, 2)-Minimum Spanning Tree Problem

@article{Shi2021TimeCA,
  title={Time Complexity Analysis of Evolutionary Algorithms for 2-Hop (1, 2)-Minimum Spanning Tree Problem},
  author={Feng Shi and Frank Neumann and Jianxin Wang},
  journal={Theor. Comput. Sci.},
  year={2021},
  volume={893},
  pages={159-175}
}
1 Citations

Figures and Tables from this paper

References

SHOWING 1-10 OF 76 REFERENCES
Runtime analysis of evolutionary algorithms for the depth restricted (1,2)-minimum spanning tree problem
TLDR
Based on the approximate solution returned by the evolutionary algorithm for the 3-Set Cover problem, an approximate solution with ratio better than 3/2 for the constrained version can be constructed.
Analysis of the $(1+1)$-EA for Finding Approximate Solutions to Vertex Cover Problems
TLDR
A theoretical analysis that explains empirical results is presented concerning the random local search algorithm and the (1+1)-EA and a lower bound for the worst case approximation ratio, slightly less than two, is proved.
The generalized minimum spanning tree problem: a parameterized complexity analysis of bi-level optimisation
TLDR
This paper examines the NP-hard generalised minimum spanning tree problem and analyses the two approaches presented by Hu and Raidl in the context of parameterised complexity, showing that they are highly complementary by proving that they solve each other's hard instances very efficiently.
Parameterized Analysis of Multi-objective Evolutionary Algorithms and the Weighted Vertex Cover Problem
TLDR
A population-based evolutionary algorithm is presented that finds a 2-approximation in expected polynomial time and a fixed parameter evolutionary algorithm with respect to OPT, the cost of the optimal solution for the problem is provided.
An efficient evolutionary algorithm for the degree-constrained minimum spanning tree problem
  • G. Raidl
  • Computer Science
    Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512)
  • 2000
TLDR
This paper proposes a novel representation technique and suitable variation operators for the degree-constrained minimum spanning tree problem and shows how problem-dependent heuristics can be effectively incorporated into the initialization, crossover, and mutation operators without increasing the time-complexity.
Revised analysis of the (1+1) ea for the minimum spanning tree problem
TLDR
An adaptive drift analysis is used and the improved bound O(m2 (sqrt{c(G)} + \log n)), where c(G) is the circumference (length of the longest cycle) of the graph, is shown, only by an asymptotic factor of at most sqrt{n}.
Runtime Performances of Randomized Search Heuristics for the Dynamic Weighted Vertex Cover Problem
TLDR
The results show that three of the four algorithms presented in the paper can recompute 2-approximate solutions for the studied dynamic changes in polynomial expected runtime, but the (1 + 1) EA with 1/5-th rule requires pseudo-polynomial expected runtime.
Runtime analysis of evolutionary algorithms with biased mutation for the multi-objective minimum spanning tree problem
TLDR
On general graphs in the single-objective setting, it is shown that a combined mutation operator which decides for unbiased or biased edge selection in each step with equal probability exhibits a polynomial upper bound in the worst case and benefits from bias if the circumstances are favorable.
Fixed-Parameter Evolutionary Algorithms and the Vertex Cover Problem
TLDR
It is shown that evolutionary algorithms solve the vertex cover problem efficiently if the size of a minimum vertex cover is not too large, i.e., the expected runtime is bounded by O(f(OPT)⋅nc), where c is a constant and f a function that only depends on OPT.
...
...