- Karl Bringmann and Tobias Friedrich. Parameterized average-case complexity of the hypervolume indicator. In Proceedings of the ACM Genetic and Evolutionary Computation Conference (GECCO), pages 575-582. ACM Press, 2013. Google ScholarDigital Library
- Dogan Corus, Per Kristian Lehre, and Frank Neumann. The generalized minimum spanning tree problem: a parameterized complexity analysis of bi-level optimisation. In Christian Blum and Enrique Alba, editors, GECCO, pages 519-526. ACM, 2013. Google ScholarDigital Library
- Stefan Kratsch, Per Kristian Lehre, Frank Neumann, and Pietro Oliveto. Fixed parameter evolutionary algorithms and maximum leaf spanning trees: A matter of mutation. In Robert Schaefer, Carlos Cotta, Joanna Kolodziej, and Günter Rudolph, editors, Parallel Problem Solving from Nature - PPSN XI, volume 6238 of Lecture Notes in Computer Science, pages 204-213. Springer Berlin / Heidelberg, 2011. Google ScholarDigital Library
- Stefan Kratsch and Frank Neumann. Fixed-parameter evolutionary algorithms and the vertex cover problem. Algorithmica, 65(4):754-771, 2013.Google ScholarDigital Library
- Samadhi Nallaperuma, Andrew M. Sutton, and Frank Neumann. Fixed-parameter evolutionary algorithms for the Euclidean traveling salesperson problem. In Evolutionary Computation (CEC), 2013 IEEE Congress on, pages 2037-2044, 2013.Google ScholarCross Ref
- Frank Neumann and Carsten Witt. Bioinspired Computation in Combinatorial Optimization - Algorithms and Their Computational Complexity. Springer, 2010. Google ScholarDigital Library
- Andrew M. Sutton, Jareth Day, and Frank Neumann. A parameterized runtime analysis of evolutionary algorithms for MAX-2-SAT. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2012), 2012. Google ScholarDigital Library
- Andrew M. Sutton and Frank Neumann. A parameterized runtime analysis of simple evolutionary algorithms for makespan scheduling. In Carlos A. Coello Coello, Vincenzo Cutello, Kalyanmoy Deb, Stephanie Forrest, Giuseppe Nicosia, and Mario Pavone, editors, Parallel Problem Solving from Nature - PPSN XII, volume 7491 of Lecture Notes in Computer Science, pages 52-61. Springer Berlin Heidelberg, 2012. Google ScholarDigital Library
- Andrew M. Sutton, Frank Neumann, and Samadhi Nallaperuma. Parameterized runtime analyses of evolutionary algorithms for the planar Euclidean traveling salesperson problem. Evolutionary Computation, (in press), 2014.Google ScholarDigital Library
Index Terms
Parameterized complexity analysis of evolutionary algorithms
Recommendations
Parameterized Complexity of Graph Burning
AbstractGraph Burning asks, given a graph and an integer k, whether there exists such that every vertex in G has distance at most i from some . This problem is known to be NP-complete even on connected caterpillars of maximum ...
Parameterized complexity dichotomy for Steiner Multicut
We consider the Steiner Multicut problem, which asks, given an undirected graph G, a collection T = { T 1 , ź , T t } , T i ź V ( G ) , of terminal sets of size at most p, and an integer k, whether there is a set S of at most k edges or nodes such that ...
On parameterized exponential time complexity
In this paper we study the notion of parameterized exponential time complexity. We show that a parameterized problem can be solved in parameterized 2^o^(^f^(^k^)^)p(n) time if and only if it is solvable in time O(2^@d^f^(^k^)q(n)) for any constant @d>0, ...
Comments