Doerr, Benjamin Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Kötzing, Timo Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Doerr, B., Hota, A., & Kötzing, T. (2012). Ants Easily Solve Stochastic Shortest Path Problems. In T. Soule, & J. H. Moore (Eds.), GECCO'12 (pp. 17-24). New York, NY: ACM.