A Tight Bound for the (1+1)-EA on the Single Source Shortest Path Problem

Doerr, Benjamin; Happ, Edda; Klein, Christian

Local TagsRelease HistoryDetailsSummary

A Tight Bound for the (1+1)-EA on the Single Source Shortest Path Problem

Doerr, B., Happ, E., & Klein, C. (2007). A Tight Bound for the (1+1)-EA on the Single Source Shortest Path Problem. In IEEE Congress on Evolutionary Computation 2007 (pp. 1890-1895). Piscataway, NJ: IEEE.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-1E46-3 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0029-B662-A

Genre: Conference Paper

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: 2008-03-04Date issued: 2007

Publication Status: Issued

Pages: -

Publishing info: -

Table of Contents: -

Rev. Type: -

Identifiers: eDoc: 356673
Other: Local-ID: C12573CC004A8E26-FB240459E98DA8DAC12573D2003B2D52-Doerr2007-CECa

Degree: -

Event

show

hide

Title: 2007 IEEE Congress on Evolutionary Computation

Place of Event: Singapore

Start-/End Date: 2007-09-25 - 2007-09-28

Legal Case

show

Project information

show

Source 1

show

hide

Title: IEEE Congress on Evolutionary Computation 2007

Source Genre: Proceedings

Creator(s):

Affiliations:

Publ. Info: Piscataway, NJ : IEEE

Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 1890 - 1895 Identifier: ISBN: 1-4244-1339-7