Login / Signup
A tight analysis of the (1 + 1)-EA for the single source shortest path problem.
Benjamin Doerr
Edda Happ
Christian Klein
Published in:
IEEE Congress on Evolutionary Computation (2007)
Keyphrases
</>
single source
shortest path problem
shortest path
interval data
evolutionary algorithm
multi source
combinatorial optimization problems
lower bound
greedy algorithm
data analysis
upper bound
directed acyclic graph