Langanzeige der Metadaten
DC Element | Wert | Sprache |
---|---|---|
dc.contributor.author | Friedrich, Tobias | de |
dc.contributor.author | Hebbinghaus, Nils | de |
dc.contributor.author | He, Jun | de |
dc.contributor.author | Neumann, Frank | de |
dc.contributor.author | Witt, Carsten | de |
dc.date.accessioned | 2009-05-12T16:01:23Z | - |
dc.date.available | 2009-05-12T16:01:23Z | - |
dc.date.issued | 2007-06 | de |
dc.identifier.uri | http://hdl.handle.net/2003/26138 | - |
dc.identifier.uri | http://dx.doi.org/10.17877/DE290R-5434 | - |
dc.description.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. | en |
dc.language.iso | en | de |
dc.relation.ispartofseries | Reihe CI; 231-07 | de |
dc.subject.ddc | 004 | de |
dc.title | On improving approximate solutions by evolutionary algorithms | en |
dc.type | Text | de |
dc.type.publicationtype | report | de |
dcterms.accessRights | open access | - |
Enthalten in den Sammlungen: | Sonderforschungsbereich (SFB) 531 |
Dateien zu dieser Ressource:
Datei | Beschreibung | Größe | Format | |
---|---|---|---|---|
23107.pdf | DNB | 214.55 kB | Adobe PDF | Öffnen/Anzeigen |
Diese Ressource ist urheberrechtlich geschützt. |
Diese Ressource ist urheberrechtlich geschützt.
rightsstatements.org