{"id":"https://openalex.org/W4385438147","doi":"https://doi.org/10.1145/3594805.3607134","title":"Fixed-Parameter Tractability of the (1 + 1) Evolutionary Algorithm on Random Planted Vertex Covers","display_name":"Fixed-Parameter Tractability of the (1 + 1) Evolutionary Algorithm on Random Planted Vertex Covers","publication_year":2023,"publication_date":"2023-07-31","ids":{"openalex":"https://openalex.org/W4385438147","doi":"https://doi.org/10.1145/3594805.3607134"},"language":"en","primary_location":{"id":"doi:10.1145/3594805.3607134","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3594805.3607134","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 17th ACM/SIGEVO Conference on Foundations of Genetic Algorithms","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2409.10144","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5092574947","display_name":"Jack Kearney","orcid":"https://orcid.org/0009-0008-0130-4782"},"institutions":[{"id":"https://openalex.org/I4210115145","display_name":"University of Minnesota, Duluth","ror":"https://ror.org/01hy4qx27","country_code":"US","type":"education","lineage":["https://openalex.org/I4210115145"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Jack Kearney","raw_affiliation_strings":["Algorithmic Evolution Lab, Department of Computer Science, University of Minnesota Duluth, Duluth, MN, USA"],"affiliations":[{"raw_affiliation_string":"Algorithmic Evolution Lab, Department of Computer Science, University of Minnesota Duluth, Duluth, MN, USA","institution_ids":["https://openalex.org/I4210115145"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5089531887","display_name":"Frank Neumann","orcid":"https://orcid.org/0000-0002-2721-3618"},"institutions":[{"id":"https://openalex.org/I5681781","display_name":"University of Adelaide","ror":"https://ror.org/00892tw58","country_code":"AU","type":"education","lineage":["https://openalex.org/I5681781"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Frank Neumann","raw_affiliation_strings":["Optimisation and Logistics Group, School of Computer Science, University of Adelaide, Adelaide, SA, Australia"],"affiliations":[{"raw_affiliation_string":"Optimisation and Logistics Group, School of Computer Science, University of Adelaide, Adelaide, SA, Australia","institution_ids":["https://openalex.org/I5681781"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5004695687","display_name":"Andrew M. Sutton","orcid":"https://orcid.org/0000-0003-1295-6715"},"institutions":[{"id":"https://openalex.org/I4210115145","display_name":"University of Minnesota, Duluth","ror":"https://ror.org/01hy4qx27","country_code":"US","type":"education","lineage":["https://openalex.org/I4210115145"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Andrew M. Sutton","raw_affiliation_strings":["Algorithmic Evolution Lab, Department of Computer Science, University of Minnesota Duluth, Duluth, MN, USA"],"affiliations":[{"raw_affiliation_string":"Algorithmic Evolution Lab, Department of Computer Science, University of Minnesota Duluth, Duluth, MN, USA","institution_ids":["https://openalex.org/I4210115145"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5092574947"],"corresponding_institution_ids":["https://openalex.org/I4210115145"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.08677203,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"96","last_page":"104"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9947999715805054,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9925000071525574,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6464152932167053},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5147933959960938},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.4891284108161926},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.40841132402420044},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.36261802911758423},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.34642598032951355},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.33173447847366333},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3303464949131012},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.09492644667625427}],"concepts":[{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6464152932167053},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5147933959960938},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.4891284108161926},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.40841132402420044},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.36261802911758423},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.34642598032951355},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33173447847366333},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3303464949131012},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.09492644667625427}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3594805.3607134","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3594805.3607134","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 17th ACM/SIGEVO Conference on Foundations of Genetic Algorithms","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:2409.10144","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2409.10144","pdf_url":"https://arxiv.org/pdf/2409.10144","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2409.10144","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2409.10144","pdf_url":"https://arxiv.org/pdf/2409.10144","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[{"display_name":"Life in Land","score":0.49000000953674316,"id":"https://metadata.un.org/sdg/15"}],"awards":[{"id":"https://openalex.org/G3128856113","display_name":null,"funder_award_id":"FT200100536","funder_id":"https://openalex.org/F4320334704","funder_display_name":"Australian Research Council"},{"id":"https://openalex.org/G7720089534","display_name":null,"funder_award_id":"2144080","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G848032724","display_name":null,"funder_award_id":"Science","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320334704","display_name":"Australian Research Council","ror":"https://ror.org/05mmh0f86"}],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4385438147.pdf"},"referenced_works_count":17,"referenced_works":["https://openalex.org/W1749374052","https://openalex.org/W2010601719","https://openalex.org/W2011113110","https://openalex.org/W2067883080","https://openalex.org/W2088415500","https://openalex.org/W2102907934","https://openalex.org/W2120043459","https://openalex.org/W2137118456","https://openalex.org/W2151612665","https://openalex.org/W2219655028","https://openalex.org/W2511114831","https://openalex.org/W2915050900","https://openalex.org/W2969531032","https://openalex.org/W3139080059","https://openalex.org/W3194285254","https://openalex.org/W4233413206","https://openalex.org/W4384024206"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2980963558","https://openalex.org/W1882246857","https://openalex.org/W3103304230","https://openalex.org/W2185360082","https://openalex.org/W1992365905","https://openalex.org/W1976691234","https://openalex.org/W3212023493","https://openalex.org/W3111310291","https://openalex.org/W2887328214"],"abstract_inverted_index":{"We":[0,19],"present":[1],"the":[2,23,31,48,69],"first":[3],"parameterized":[4],"analysis":[5],"of":[6,15],"a":[7,13,41,73],"standard":[8],"(1+1)":[9,32,70],"Evolutionary":[10],"Algorithm":[11],"on":[12],"distribution":[14],"vertex":[16],"cover":[17,25,42,50],"problems.":[18],"show":[20],"that":[21,68],"if":[22],"planted":[24,49,64],"is":[26],"at":[27,43],"most":[28],"logarithmic,":[29],"restarting":[30],"EA":[33,71],"every":[34],"O(n":[35],"log":[36],"n)":[37],"steps":[38],"will":[39],"find":[40],"least":[44],"as":[45,47],"small":[46],"in":[51,75,79],"polynomial":[52],"time":[53,78],"for":[54],"sufficiently":[55],"dense":[56],"random":[57],"graphs":[58],"p":[59],">":[60],"0.71.":[61],"For":[62],"superlogarithmic":[63],"covers,":[65],"we":[66],"prove":[67],"finds":[72],"solution":[74],"fixed-parameter":[76],"tractable":[77],"expectation.":[80]},"counts_by_year":[],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}