Fixed-Parameter Tractability of the (1+1) Evolutionary Algorithm on Random Planted Vertex Covers

We present the first parameterized analysis of a standard (1+1) Evolutionary Algorithm on a distribution of vertex cover problems. We show that if the planted cover is at most logarithmic, restarting the (1+1) EA every \(O(n \log n)\) steps will find a cover at least as small as the planted cover in...

Full description

Bibliographic Details

Published in:	arXiv.org
Main Authors:	Kearney, Jack, Neumann, Frank, Sutton, Andrew M
Format:	Paper
Language:	English
Published:	Ithaca Cornell University Library, arXiv.org 16.09.2024
Subjects:	Evolutionary algorithms Parameters Polynomials
ISSN:	2331-8422
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!