Fixed parameter multi-objective evolutionary algorithms for the W-separator problem

DOI10.1007/S00453-024-01290-9MaRDI QIDQ7006523zbMATH OpenFDO

Authors Samuel Baguley, Tobias Friedrich, Aneta Neumann, F. Neumann, Marcus Pappik

Publication date 28 March 2025

Published in Algorithmica (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S00453-024-01290-9

zbMATH Keywords

evolutionary algorithmsparameterized complexityruntime analysis

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Parameterized complexity, tractability and kernelization (68Q27)

Cites work

• scientific article; zbMATH DE number 6857816 (Why is no real title available?)
• scientific article; zbMATH DE number 7740881 (Why is no real title available?)
• A Separator Theorem for Planar Graphs
• Analyzing evolutionary algorithms. The computer science perspective.
• Bioinspired computation in combinatorial optimization. Algorithms and their computational complexity
• Fixed-parameter evolutionary algorithms and the vertex cover problem
• Fixed-parameter tractability of crossover: steady-state GAs on the closest string problem
• Focused jump-and-repair constraint handling for fixed-parameter tractable graph problems
• Kernelization. Theory of parameterized preprocessing
• Linear kernels for separating a graph into components of bounded size
• Maximal Flow Through a Network
• On the computational complexity of vertex integrity and component order connectivity
• Partitioning a graph into small pieces with applications to path transversal
• Theory of evolutionary computation. Recent developments in discrete optimization
• Vertex cover might be hard to approximate to within \(2 - \varepsilon \)

Cited in

(1)

• Combining crown structures for vulnerability measures

This page was built for publication: Fixed parameter multi-objective evolutionary algorithms for the \(W\)-separator problem

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