Name
Abstract | ||
|---|---|---|
Hybrid methods are very popular for solving prob- lems from combinatorial optimization. In contrast to this the theoretical understanding of the interplay of different optimiza- tion 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. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1109/CEC.2007.4424800 | IEEE Congress on Evolutionary Computation |
Keywords | DocType | ISBN |
approximation theory,combinatorial mathematics,evolutionary computation,approximation algorithms,combinatorial optimization,evolutionary algorithms,hybrid methods,polynomial time,vertex cover problem | Conference | 978-1-4244-1340-9 |
Citations | PageRank | References |
3 | 0.44 | 16 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tobias Friedrich | 1 | 352 | 20.18 |
| jun he | 2 | 5 | 1.17 |
| nils hebbinghaus | 3 | 3 | 0.44 |
| Frank Neumann | 4 | 1727 | 124.28 |
| Carsten Witt | 5 | 987 | 59.83 |