Benjamin Doerr

Suggest Changes
Carsten Witt117
Ingo Wegener116
Thomas Jansen114
Frank Neumann81
Stefan Droste75
78Dirk Sudholt
75Carola Doerr
64Carsten Witt
62Tobias Friedrich
60Frank Neumann

Filter Results:

  • Full text PDF available (132)

Publication Year

1999
2017
  • This year (9)
  • Last 5 years (78)
  • Last 10 years (148)

Publication Type

Co-author

Publication Venue

Key Phrases

Learn More
Multiplicative Drift Analysis
Drift analysis is one of the strongest tools in the analysis of evolutionary algorithms. Its main weakness is that it is often very hard to find a good drift function. In this paper, we make progress in this direction. We prove a multiplicative version of the classical drift theorem. This allows easier analyses in those settings, where the optimization… (More)
Social Networks Spread Rumors in Sublogarithmic Time
With the prevalence of social networks, it has become increasingly important to understand their features and limitations. It has been observed that information spreads extremely fast in social networks. We study the performance of randomized rumor spreading protocols on graphs in the preferential attachment model. The well-known random phone call model of… (More)
Adaptive Drift Analysis
We show that, for any c>0, the (1+1) evolutionary algorithm using an arbitrary mutation rate p n =c/n finds the optimum of a linear objective function over bit strings of length n in expected time Θ(nlogn). Previously, this was only known for c≤1. Since previous work also shows that universal drift functions cannot exist for c larger than a certain… (More)
Stabilizing consensus with the power of two choices
In the standard consensus problem there are <i>n</i> processes with possibly different input values and the goal is to eventually reach a point at which all processes commit to exactly one of these values. We are studying a slight variant of the consensus problem called the <i>stabilizing consensus problem</i> [2]. In this problem, we do not require that… (More)
Sharp bounds by probability-generating functions and variable drift
We introduce to the runtime analysis of evolutionary algorithms two powerful techniques: probability-generating functions and variable drift analysis. They are shown to provide a clean framework for proving sharp upper and lower bounds. As an application, we improve the results by Doerr et al. (GECCO~2010) in several respects. First, the upper bound on the… (More)
A tight analysis of the (1 + 1)-EA for the single source shortest path problem
— We conduct a rigorous analysis of the (1 + 1) evolutionary algorithm for the single source shortest path problem proposed by Scharnow, Tinnefeld and Wegener (Journal of Mathematical Modelling and Algorithms, 2004). We prove a tight bound of Θ(n 2 max{log(n), ℓ}) on the optimization time, where ℓ is the maximum number of edges of a shortest path with… (More)