Edda Happ

According to our database, Edda Happ authored at least 6 papers between 2006 and 2012.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2012

Crossover can provably be useful in evolutionary computation.

Benjamin Doerr, Edda Happ, Christian Klein

Theor. Comput. Sci., 2012

2011

Tight Analysis of the (1+1)-EA for the Single Source Shortest Path Problem.

Benjamin Doerr, Edda Happ, Christian Klein

Evol. Comput., 2011

2009

Analyses of evolutionary algorithms.

Edda Happ

PhD thesis, 2009

2008

Rigorous analyses of fitness-proportional selection for optimizing linear functions.

Edda Happ, Daniel Johannsen, Christian Klein, Frank Neumann

Proceedings of the Genetic and Evolutionary Computation Conference, 2008

Directed trees: A powerful representation for sorting and ordering problems.

Benjamin Doerr, Edda Happ

Proceedings of the IEEE Congress on Evolutionary Computation, 2008

2006

Provisioning a Virtual Private Network Under the Presence of Non-communicating Groups.

Friedrich Eisenbrand, Edda Happ

Proceedings of the Algorithms and Complexity, 6th Italian Conference, 2006