Autor(en): Friedrich, Tobias
Hebbinghaus, Nils
He, Jun
Neumann, Frank
Witt, Carsten
Titel: On improving approximate solutions by evolutionary algorithms
Sprache (ISO): en
Zusammenfassung: Hybrid methods are very popular for solving problems from combinatorial optimization. In contrast to this the theoretical understanding of the interplay of different optimization methods is rare. The aim of this paper is to make a first step into the rigorous analysis of such combinations for combinatorial optimization problems. The subject of our analyses is the vertex cover problem for which several approximation algorithms have been proposed. We point out specific instances where solutions can (or cannot) be improved by the search process of a simple evolutionary algorithm in expected polynomial time.
URI: http://hdl.handle.net/2003/26138
http://dx.doi.org/10.17877/DE290R-5434
Erscheinungsdatum: 2007-06
Enthalten in den Sammlungen:Sonderforschungsbereich (SFB) 531

Dateien zu dieser Ressource:
Datei Beschreibung GrößeFormat 
23107.pdfDNB214.55 kBAdobe PDFÖffnen/Anzeigen


Diese Ressource ist urheberrechtlich geschützt.



Diese Ressource ist urheberrechtlich geschützt. rightsstatements.org