English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
  More Effective Crossover Operators for the All-Pairs Shortest Path Problem

Doerr, B., Johannsen, D., Kötzing, T., Neumann, F., & Theile, M. (2013). More Effective Crossover Operators for the All-Pairs Shortest Path Problem. Theoretical Computer Science, 471, 12-26. doi:10.1016/j.tcs.2012.10.059.

Item is

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Doerr, Benjamin1, Author           
Johannsen, Daniel2, Author
Kötzing, Timo2, Author           
Neumann, Frank2, Author
Theile, Madeleine2, Author
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              
2External Organizations, ou_persistent22              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 20132013
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: Other: Local-ID: 39E06A3D747E8472C1257AD000448E13-DoerrJKNT13
DOI: 10.1016/j.tcs.2012.10.059
BibTex Citekey: DoerrJKNT13
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: Theoretical Computer Science
Source Genre: Journal
 Creator(s):
Affiliations:
Publ. Info: Amsterdam : Elsevier
Pages: - Volume / Issue: 471 Sequence Number: - Start / End Page: 12 - 26 Identifier: ISSN: 0304-3975
CoNE: https://pure.mpg.de/cone/journals/resource/954925512450