Show simple item record

dc.contributor.author Witt, Carsten
dc.contributor.author Friedrich, Tobias
dc.contributor.author Hebbinghaus, Nils
dc.contributor.author He, Jun
dc.contributor.author Neumann, Frank
dc.date.accessioned 2009-05-28T07:37:51Z
dc.date.available 2009-05-28T07:37:51Z
dc.date.issued 2009-05-28
dc.identifier.citation Witt , C , Friedrich , T , Hebbinghaus , N , He , J & Neumann , F 2009 , ' Analyses of Simple Hybrid Algorithms for the Vertex Cover Problem ' Evolutionary Computation , pp. 3-19 . en
dc.identifier.other PURE: 115384
dc.identifier.other dspace: 2160/2416
dc.identifier.uri http://hdl.handle.net/2160/2416
dc.description T. Friedrich, J. He, N. Hebbinghaus, F. Neumann and C. Witt. Analyses of Simple Hybrid Algorithms for the Vertex Cover Problem. Evolutionary Computation, 17(1):3-19, 2009. en
dc.description.abstract Hybrid methods are very popular for solving problems from combinatorial optimization. In contrast, the theoretical understanding of the interplay of different optimization methods is rare. In this paper, we 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.format.extent 17 en
dc.language.iso eng
dc.relation.ispartof Evolutionary Computation en
dc.title Analyses of Simple Hybrid Algorithms for the Vertex Cover Problem en
dc.type Text en
dc.type.publicationtype Article (Journal) en
dc.contributor.institution Department of Computer Science en
dc.description.status Peer reviewed en


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

Search Cadair


Advanced Search

Browse

Statistics