Approximating Minimum Multicuts by Evolutionary Multi-Objective Algorithms

Neumann, Frank; Reichel, Joachim

doi:10.1007/978-3-540-87700-4_8

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

Approximating Minimum Multicuts by Evolutionary Multi-Objective Algorithms

MPS-Authors

/persons/resource/persons45115

Neumann, Frank
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45275

Reichel, Joachim
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

Neumann, F., & Reichel, J. (2008). Approximating Minimum Multicuts by Evolutionary Multi-Objective Algorithms. In G. Rudolph, T. Jansen, S. M. Lucas, C. Poloni, & N. Beume (Eds.), Parallel Problem Solving from Nature – PPSN X (pp. 72-81). Berlin: Springer. doi:10.1007/978-3-540-87700-4_8.

Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-1B00-4

Abstract

There is no abstract available