A simplified NP-complete MAXSAT problem
Information Processing Letters
SIAM Review
Ant Colony Optimization
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Fixed-parameter evolutionary algorithms and the vertex cover problem
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Fixed parameter evolutionary algorithms and maximum leaf spanning trees: a matter of mutation
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
Bioinspired Computation in Combinatorial Optimization: Algorithms and Their Computational Complexity
Bioinspired Computation in Combinatorial Optimization: Algorithms and Their Computational Complexity
Theory of Randomized Search Heuristics: Foundations and Recent Developments
Theory of Randomized Search Heuristics: Foundations and Recent Developments
Local search and the local structure of NP-complete problems
Operations Research Letters
Parameterized Complexity
A parameterized runtime analysis of simple evolutionary algorithms for makespan scheduling
PPSN'12 Proceedings of the 12th international conference on Parallel Problem Solving from Nature - Volume Part I
Hi-index | 0.00 |
We investigate the MAX-2-SAT problem and study evolutionary algorithms by parameterized runtime analysis. The parameterized runtime analysis of evolutionary algorithms has been initiated recently and reveals new insights into which type of instances of NP-hard combinatorial optimization problems are hard to solve by evolutionary computing methods. We show that a variant of the (1+1) EA is a fixed-parameter evolutionary algorithm with respect to the standard parameterization for MAX-2-SAT. Furthermore, we study how the dependencies between the variables affect problem difficulty and present fixed-parameter evolutionary algorithms for the MAX-(2,3)-SAT problem where the studied parameter is the diameter of the variable graph.