English
 
User Manual Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Journal Article

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

MPS-Authors
/persons/resource/persons44338

Doerr,  Benjamin
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons44584

Happ,  Edda
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons44793

Klein,  Christian
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

Locator
There are no locators available
Fulltext (public)
There are no public fulltexts available
Supplementary Material (public)
There is no public supplementary material available
Citation

Doerr, B., Happ, E., & Klein, C. (2011). Tight Analysis of the (1+1)-EA for the Single Source Shortest Path Problem. Evolutionary Computation, 19(4), 673-691. doi:10.1162/EVCO_a_00047.


Cite as: http://hdl.handle.net/11858/00-001M-0000-0010-12B4-4
Abstract
There is no abstract available