More Effective Crossover Operators for the All-Pairs Shortest Path Problem

Doerr, Benjamin; Johannsen, Daniel; Kötzing, Timo; Neumann, Frank; Theile, Madeleine

doi:10.1016/j.tcs.2012.10.059

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Journal Article

More Effective Crossover Operators for the All-Pairs Shortest Path Problem

MPS-Authors

/persons/resource/persons44338

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

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

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.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0015-3C2B-0

Abstract

There is no abstract available