Output details
11 - Computer Science and Informatics
University of Sheffield
Return to search
Output 0 of 0 in the submission
Article title
Analysis of the (1+1)-EA for Finding Approximate Solutions to Vertex Cover Problems
Type
D - Journal article
Title of journal
IEEE Transactions on Evolutionary Computation
Article number
-
Volume number
13
Issue number
5
First page of article
1006
ISSN of journal
19410026
Year of publication
2009
Number of additional authors
2
Additional information
<12> IEEE TEVC is the premier journal in the field (5-year IF 6.226, first in 'Computer Science, Theory and Methods'). For the first time rigorous non-trivial bounds are derived on the worst case approximations guaranteed by Evolutionary Algorithms for the NP-hard Vertex Cover (VC) problem. The work led to collaborative research visits to Dortmund (6 months), AT&T-Research Labs (3 months) and an award-winning paper on Artificial Immune Systems (AIS) for VC in collaboration with Warwick and Cork (ICARIS'11, main AIS conference). It formed the core of Oliveto’s successful EPSRC Fellowship (EP/H028900/1) (13% acceptance rate).
Interdisciplinary
-
Cross-referral requested
-
Research group
A - Computational Biology
Citation count
14
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-
