1 code implementation • 6 Nov 2019 • Lukas Behrendt, Katrin Casel, Tobias Friedrich, J. A. Gregor Lagodzinski, Alexander Löser, Marcus Wilhelm
Our generalization of the tree doubling algorithm gives a parameterized 3-approximation, where the parameter is the number of asymmetric edges in a given minimum spanning arborescence.
Data Structures and Algorithms
no code implementations • 6 Jun 2018 • Benjamin Doerr, Timo Kötzing, J. A. Gregor Lagodzinski, Johannes Lengler
While many optimization problems work with a fixed number of decision variables and thus a fixed-length representation of possible solutions, genetic programming (GP) works on variable-length representations.
2 code implementations • 25 May 2018 • Timo Kötzing, J. A. Gregor Lagodzinski, Johannes Lengler, Anna Melnichenko
We show that the Concatenation Crossover GP can efficiently optimize these test functions, while local search cannot be efficient for all three variants independent of employing bloat control.
