Fixed Parameter Evolutionary Algorithms and Maximum Leaf Spanning Trees: A 
Matter of Mutation

Kratsch, Stefan; Lehre, Per Kristian; Neumann, Frank; Oliveto, Pietro Simone

doi:10.1007/978-3-642-15844-5_21

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

Fixed Parameter Evolutionary Algorithms and Maximum Leaf Spanning Trees: A Matter of Mutation

MPS-Authors

/persons/resource/persons44840

Kratsch, Stefan
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons44904

Lehre, Per Kristian
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45115

Neumann, Frank
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

Kratsch, S., Lehre, P. K., Neumann, F., & Oliveto, P. S. (2010). Fixed Parameter Evolutionary Algorithms and Maximum Leaf Spanning Trees: A Matter of Mutation. In R. Schaefer, C. Cotta, J. Kolodziej, & G. Rudolph (Eds.), Parallel Problem Solving from Nature (pp. 204-213). Berlin: Springer. doi:10.1007/978-3-642-15844-5_21.

Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-1659-6

Abstract

There is no abstract available