Fixed-parameter tractability of crossover: steady-state GAs on the closest string problem
From MaRDI portal
Publication:2661998
DOI10.1007/S00453-021-00809-8OpenAlexW3131365436MaRDI QIDQ2661998FDOQ2661998
Authors: Andrew M. Sutton 
Publication date: 8 April 2021
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-021-00809-8
Recommendations
- Fixed-parameter algorithms for CLOSEST STRING and related problems
- Randomized fixed-parameter algorithms for the closest string problem
- A three-string approach to the closest string problem
- A three-string approach to the closest string problem
- Designing and Implementing Algorithms for the Closest String Problem
Cites Work
- Computational Complexity
- Fixed-parameter algorithms for CLOSEST STRING and related problems
- Distinguishing string selection problems.
- Parametrized complexity theory.
- Fundamentals of Error-Correcting Codes
- More efficient algorithms for closest string and substring problems
- Efficient Algorithms for the Closest String and Distinguishing String Selection Problems
- Parameterized algorithms
- On covering problems of codes
- Hadamard matrices and their applications
- Optimal speedup of Las Vegas algorithms
- Analyzing randomized search heuristics: tools from probability theory
- A closer look at the closest string and closest substring problem
- Concentration of first hitting times under additive drift
- Title not available (Why is that?)
- The analysis of evolutionary algorithms -- A proof that crossover really can help
- Crossover can be constructive when computing unique input-output sequences
- Crossover can provably be useful in evolutionary computation
- Faster black-box algorithms through higher arity operators
- From black-box complexity to designing new genetic algorithms
- A method for obtaining randomized algorithms with small tail probabilities
- Fixed-parameter evolutionary algorithms and the vertex cover problem
- More effective crossover operators for the all-pairs shortest path problem
- Destructiveness of lexicographic parsimony pressure and alleviation by a concatenation crossover in genetic programming
- On the benefits of populations for the exploitation speed of standard steady-state genetic algorithms
Cited In (4)
- Crossover can guarantee exponential speed-ups in evolutionary multi-objective optimisation
- (1+1) genetic programming with functionally complete instruction sets can evolve Boolean conjunctions and disjunctions with arbitrarily small error
- Tight bounds on the expected runtime of a standard steady state genetic algorithm
- Focused jump-and-repair constraint handling for fixed-parameter tractable graph problems closed under induced subgraphs
This page was built for publication: Fixed-parameter tractability of crossover: steady-state GAs on the closest string problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2661998)
