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

Doerr, Benjamin; Happ, Edda; Klein, Christian

doi:10.1162/EVCO_a_00047

Local TagsRelease HistoryDetailsSummary

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

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.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0010-12B4-4 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0010-12B5-2

Genre: Journal Article

Files

show Files

Locators

show

Creators

show

hide

Creators:
Doerr, Benjamin¹, Author
Happ, Edda¹, Author
Klein, Christian¹, Author

Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019

Content

show

Details

show

hide

Language(s): eng - English

Dates: Modified: 2012-03-19Date issued: 2011

Publication Status: Issued

Pages: -

Publishing info: -

Table of Contents: -

Rev. Type: Peer

Identifiers: eDoc: 618687
DOI: 10.1162/EVCO_a_00047
URI: http://dx.doi.org/10.1162/EVCO_a_00047
Other: Local-ID: C1256428004B93B8-FA4ACE04ECB183AFC125793C00380F07-DoerrHK11

Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show

hide

Title: Evolutionary Computation

Source Genre: Journal

Creator(s):

Affiliations:

Publ. Info: Cambridge, MA : MIT Press

Pages: - Volume / Issue: 19 (4) Sequence Number: - Start / End Page: 673 - 691 Identifier: ISSN: 1063-6560