Computing Minimum Cuts by Randomized Search Heuristics

Neumann, Frank; Reichel, Joachim; Skutella, Martin

doi:10.1145/1389095.1389250

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

Computing Minimum Cuts by Randomized Search Heuristics

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;

/persons/resource/persons45503

Skutella, Martin
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., & Skutella, M. (2008). Computing Minimum Cuts by Randomized Search Heuristics. In M. Keijzer, G. Antoniol., C. B. Congdon, K. Deb, B. Doerr, N. Hansen, et al. (Eds.), GECCO'08 (pp. 779-786). New York, NY: ACM. doi:10.1145/1389095.1389250.

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

Abstract

There is no abstract available