Authors: Friedrich, Tobias
Hebbinghaus, Nils
He, Jun
Neumann, Frank
Witt, Carsten
Title: On improving approximate solutions by evolutionary algorithms
Language (ISO): en
Abstract: 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
Issue Date: 2007-06
Appears in Collections:Sonderforschungsbereich (SFB) 531

Files in This Item:
File Description SizeFormat 
23107.pdfDNB214.55 kBAdobe PDFView/Open


This item is protected by original copyright



All resources in the repository are protected by copyright.