Please use this identifier to cite or link to this item: http://dx.doi.org/10.14279/depositonce-14409
For citation please use:
Main Title: Approximating Minimum Multicuts by Evolutionary Multi-Objective Algorithms
Author(s): Neumann, Frank
Reichel, Joachim
Type: Research Paper
URI: https://depositonce.tu-berlin.de/handle/11303/15636
http://dx.doi.org/10.14279/depositonce-14409
License: http://rightsstatements.org/vocab/InC/1.0/
Abstract: It has been shown that simple evolutionary algorithms are able to solve the minimum cut problem in expected polynomial time when using a multi-objective model of the problem. In this paper, we generalize these ideas to the NP-hard minimum multicut problem. Given a set of k terminal pairs, we prove that evolutionary algorithms in combination with a multi-objective model of the problem are able to obtain a k-approximation for this problem in expected polynomial time.
Subject(s): evolutionary algorithms
minimum multicuts
multi-objective optimization
randomized search heuristics
Issue Date: 2008
Date Available: 17-Dec-2021
Language Code: en
DDC Class: 510 Mathematik
Series: Preprint-Reihe des Instituts für Mathematik, Technische Universität Berlin
Series Number: 2008, 23
ISSN: 2197-8085
TU Affiliation(s): Fak. 2 Mathematik und Naturwissenschaften » Inst. Mathematik
Appears in Collections:Technische Universität Berlin » Publications

Files in This Item:
Report-023-2008.pdf
Format: Adobe PDF | Size: 169.94 kB
DownloadShow Preview
Thumbnail
Report-023-2008.ps.gz
Format: Unknown | Size: 307.98 kB
Download

Item Export Bar

Items in DepositOnce are protected by copyright, with all rights reserved, unless otherwise indicated.