{"id":"https://openalex.org/W2090677529","doi":"https://doi.org/10.1145/1569901.1569943","title":"Fixed-parameter evolutionary algorithms and the vertex cover problem","display_name":"Fixed-parameter evolutionary algorithms and the vertex cover problem","publication_year":2009,"publication_date":"2009-07-08","ids":{"openalex":"https://openalex.org/W2090677529","doi":"https://doi.org/10.1145/1569901.1569943","mag":"2090677529"},"language":"en","primary_location":{"id":"doi:10.1145/1569901.1569943","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1569901.1569943","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 11th Annual conference on Genetic and evolutionary computation","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5050140825","display_name":"Stefan Kratsch","orcid":"https://orcid.org/0000-0002-0193-7239"},"institutions":[{"id":"https://openalex.org/I149899117","display_name":"Max Planck Society","ror":"https://ror.org/01hhn8329","country_code":"DE","type":"funder","lineage":["https://openalex.org/I149899117"]},{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Stefan Kratsch","raw_affiliation_strings":["Max-Planck-Institute for Computer Science, Saarbruecken, Germany","Max Planck Institute for Computer Science, Saarbruecken, Germany#TAB#"],"affiliations":[{"raw_affiliation_string":"Max-Planck-Institute for Computer Science, Saarbruecken, Germany","institution_ids":["https://openalex.org/I4210109712"]},{"raw_affiliation_string":"Max Planck Institute for Computer Science, Saarbruecken, Germany#TAB#","institution_ids":["https://openalex.org/I149899117"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5089531887","display_name":"Frank Neumann","orcid":"https://orcid.org/0000-0002-2721-3618"},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]},{"id":"https://openalex.org/I149899117","display_name":"Max Planck Society","ror":"https://ror.org/01hhn8329","country_code":"DE","type":"funder","lineage":["https://openalex.org/I149899117"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Frank Neumann","raw_affiliation_strings":["Max-Planck-Institut for Computer Science, Saarbruecken, Germany","Max-Planck-Institut for Computer Science, Saarbruecken, Germany#TAB#"],"affiliations":[{"raw_affiliation_string":"Max-Planck-Institut for Computer Science, Saarbruecken, Germany","institution_ids":["https://openalex.org/I4210109712"]},{"raw_affiliation_string":"Max-Planck-Institut for Computer Science, Saarbruecken, Germany#TAB#","institution_ids":["https://openalex.org/I149899117"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5050140825"],"corresponding_institution_ids":["https://openalex.org/I149899117","https://openalex.org/I4210109712"],"apc_list":null,"apc_paid":null,"fwci":3.0856,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.91921003,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"293","last_page":"300"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9909999966621399,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9909999966621399,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.9865999817848206,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9855999946594238,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.9224864840507507},{"id":"https://openalex.org/keywords/kernelization","display_name":"Kernelization","score":0.8889977931976318},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.7279295325279236},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.5752536654472351},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5449158549308777},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.5424474477767944},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5226421356201172},{"id":"https://openalex.org/keywords/edge-cover","display_name":"Edge cover","score":0.4993758201599121},{"id":"https://openalex.org/keywords/set-cover-problem","display_name":"Set cover problem","score":0.48029062151908875},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.462103009223938},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4314744770526886},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3446463346481323},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.33082115650177},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.30676954984664917},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.1340269148349762},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.09984830021858215}],"concepts":[{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.9224864840507507},{"id":"https://openalex.org/C207225210","wikidata":"https://www.wikidata.org/wiki/Q1759539","display_name":"Kernelization","level":3,"score":0.8889977931976318},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.7279295325279236},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.5752536654472351},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5449158549308777},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.5424474477767944},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5226421356201172},{"id":"https://openalex.org/C17762858","wikidata":"https://www.wikidata.org/wiki/Q594001","display_name":"Edge cover","level":3,"score":0.4993758201599121},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.48029062151908875},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.462103009223938},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4314744770526886},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3446463346481323},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.33082115650177},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.30676954984664917},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.1340269148349762},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.09984830021858215},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1569901.1569943","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1569901.1569943","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 11th Annual conference on Genetic and evolutionary computation","raw_type":"proceedings-article"},{"id":"pmh:oai:digital.library.adelaide.edu.au:2440/65941","is_oa":false,"landing_page_url":"http://hdl.handle.net/2440/65941","pdf_url":null,"source":{"id":"https://openalex.org/S4306401835","display_name":"Adelaide Research & Scholarship (AR&S) (University of Adelaide)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I5681781","host_organization_name":"The University of Adelaide","host_organization_lineage":["https://openalex.org/I5681781"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://dx.doi.org/10.1145/1569901.1569943","raw_type":"Conference paper"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W36639738","https://openalex.org/W1507039213","https://openalex.org/W1510977876","https://openalex.org/W1522890465","https://openalex.org/W1523006294","https://openalex.org/W1559081432","https://openalex.org/W1573676079","https://openalex.org/W1593495653","https://openalex.org/W1632066424","https://openalex.org/W1971718861","https://openalex.org/W1978984733","https://openalex.org/W1981898306","https://openalex.org/W2013415302","https://openalex.org/W2026771935","https://openalex.org/W2053175541","https://openalex.org/W2064739942","https://openalex.org/W2091824805","https://openalex.org/W2100137329","https://openalex.org/W2105792062","https://openalex.org/W2120043459","https://openalex.org/W2121555757","https://openalex.org/W2151612665","https://openalex.org/W2153401898","https://openalex.org/W2157816158","https://openalex.org/W2162189348","https://openalex.org/W2295428206","https://openalex.org/W2486813313","https://openalex.org/W2585305412","https://openalex.org/W2752885492","https://openalex.org/W2911346016","https://openalex.org/W3145128584","https://openalex.org/W4214544502","https://openalex.org/W4234274482","https://openalex.org/W7029321148"],"related_works":["https://openalex.org/W2043560626","https://openalex.org/W1759554648","https://openalex.org/W2145388251","https://openalex.org/W2141026984","https://openalex.org/W2063671489","https://openalex.org/W41549461","https://openalex.org/W2116388786","https://openalex.org/W2319388310","https://openalex.org/W2088415500","https://openalex.org/W2526148662"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,71],"consider":[4],"multi-objective":[5],"evolutionary":[6,45,74,120],"algorithms":[7,25,46,75,121,126],"for":[8,127],"the":[9,14,21,27,31,41,54,77,83,95,128],"Vertex":[10],"Cover":[11],"problem":[12,80],"in":[13],"context":[15],"of":[16,23,33,44,56,63,85],"parameterized":[17,66],"complexity.":[18],"We":[19],"relate":[20],"runtime":[22,97],"our":[24],"to":[26,53],"input":[28],"size":[29,84],"and":[30,37,108],"cost":[32],"a":[34,57,60,86,106,110],"minimum":[35,87],"solution":[36],"point":[38],"out":[39],"that":[40,50,73,112,119],"search":[42],"process":[43],"creates":[47],"partial":[48],"solutions":[49],"are":[51,122],"similar":[52],"effect":[55],"kernelization":[58],"(i.e.":[59],"special":[61],"type":[62],"preprocessing":[64],"from":[65],"complexity).":[67],"Based":[68],"on":[69,115],"this,":[70],"show":[72],"solve":[76],"vertex":[78,88,129],"cover":[79,89,130],"efficiently":[81],"if":[82],"is":[90,98,105],"not":[91],"too":[92],"large,":[93],"i.e.":[94],"expected":[96],"bounded":[99],"by":[100],"O(f(OPT)":[101],"nc),":[102],"where":[103],"c":[104],"constant":[107],"f":[109],"function":[111],"only":[113],"depends":[114],"OPT.":[116],"This":[117],"shows":[118],"randomized":[123],"fixed-parameter":[124],"tractable":[125],"problem.":[131]},"counts_by_year":[{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":5}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}