English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
  Edge-based Representation Beats Vertex-based Representation in Shortest Path Problems

Doerr, B., & Johannsen, D. (2010). Edge-based Representation Beats Vertex-based Representation in Shortest Path Problems. In M. Pelikan, & J. Branke (Eds.), Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (pp. 759-766). New York, NY: ACM. doi:10.1145/1830483.1830618.

Item is

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Doerr, Benjamin1, Author           
Johannsen, Daniel1, Author           
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 20102010
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 536784
DOI: 10.1145/1830483.1830618
Other: Local-ID: C1256428004B93B8-3EB4D21F761F151BC12578180049A8CF-DoerrJ2010
 Degree: -

Event

show
hide
Title: 12th Annual Conference on Genetic and Evolutionary Computation
Place of Event: Portland, USA
Start-/End Date: 2010-07-07 - 2010-07-11

Legal Case

show

Project information

show

Source 1

show
hide
Title: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation
  Abbreviation : GECCO 2010
Source Genre: Proceedings
 Creator(s):
Pelikan, Martin1, Editor
Branke, Jürgen1, Editor
Affiliations:
1 External Organizations, ou_persistent22            
Publ. Info: New York, NY : ACM
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 759 - 766 Identifier: ISBN: 978-1-4503-0072-5