{"id":"https://openalex.org/W2079241742","doi":"https://doi.org/10.1145/2739480.2754700","title":"Maintaining 2-Approximations for the Dynamic Vertex Cover Problem Using Evolutionary Algorithms","display_name":"Maintaining 2-Approximations for the Dynamic Vertex Cover Problem Using Evolutionary Algorithms","publication_year":2015,"publication_date":"2015-07-07","ids":{"openalex":"https://openalex.org/W2079241742","doi":"https://doi.org/10.1145/2739480.2754700","mag":"2079241742"},"language":"en","primary_location":{"id":"doi:10.1145/2739480.2754700","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2739480.2754700","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2015 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/A5019690312","display_name":"Mojgan Pourhassan","orcid":null},"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":true,"raw_author_name":"Mojgan Pourhassan","raw_affiliation_strings":["The University of Adelaide, Adelaide, Australia"],"affiliations":[{"raw_affiliation_string":"The University of Adelaide, Adelaide, Australia","institution_ids":["https://openalex.org/I5681781"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5028357788","display_name":"Wanru Gao","orcid":null},"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":"Wanru Gao","raw_affiliation_strings":["The University of Adelaide, Adelaide, Australia"],"affiliations":[{"raw_affiliation_string":"The University of Adelaide, Adelaide, Australia","institution_ids":["https://openalex.org/I5681781"]}]},{"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/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":["The University of Adelaide, Adelaide, Australia"],"affiliations":[{"raw_affiliation_string":"The University of Adelaide, Adelaide, Australia","institution_ids":["https://openalex.org/I5681781"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5019690312"],"corresponding_institution_ids":["https://openalex.org/I5681781"],"apc_list":null,"apc_paid":null,"fwci":2.0007908,"has_fulltext":false,"cited_by_count":29,"citation_normalized_percentile":{"value":0.88767894,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"903","last_page":"910"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9962000250816345,"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.9962000250816345,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9936000108718872,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9883999824523926,"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-cover","display_name":"Vertex cover","score":0.8126076459884644},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.6340116858482361},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.6271641254425049},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5877776741981506},{"id":"https://openalex.org/keywords/perspective","display_name":"Perspective (graphical)","score":0.5455554723739624},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5437089800834656},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5071585178375244},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.47772833704948425},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.465471476316452},{"id":"https://openalex.org/keywords/dynamic-problem","display_name":"Dynamic problem","score":0.46244174242019653},{"id":"https://openalex.org/keywords/set-cover-problem","display_name":"Set cover problem","score":0.456226646900177},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3750385642051697},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3186313211917877},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.22051501274108887},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.1976856291294098},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.13969743251800537}],"concepts":[{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.8126076459884644},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.6340116858482361},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.6271641254425049},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5877776741981506},{"id":"https://openalex.org/C12713177","wikidata":"https://www.wikidata.org/wiki/Q1900281","display_name":"Perspective (graphical)","level":2,"score":0.5455554723739624},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5437089800834656},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5071585178375244},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.47772833704948425},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.465471476316452},{"id":"https://openalex.org/C99580578","wikidata":"https://www.wikidata.org/wiki/Q5319002","display_name":"Dynamic problem","level":2,"score":0.46244174242019653},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.456226646900177},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3750385642051697},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3186313211917877},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.22051501274108887},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.1976856291294098},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.13969743251800537},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"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/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/2739480.2754700","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2739480.2754700","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation","raw_type":"proceedings-article"},{"id":"pmh:oai:digital.library.adelaide.edu.au:2440/109196","is_oa":false,"landing_page_url":"http://hdl.handle.net/2440/109196","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/2739480.2754700","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":11,"referenced_works":["https://openalex.org/W1582032289","https://openalex.org/W1859357731","https://openalex.org/W2011113110","https://openalex.org/W2051169745","https://openalex.org/W2088415500","https://openalex.org/W2120043459","https://openalex.org/W2151015304","https://openalex.org/W2151612665","https://openalex.org/W2162189348","https://openalex.org/W4285719527","https://openalex.org/W4372046852"],"related_works":["https://openalex.org/W2112112676","https://openalex.org/W2108073487","https://openalex.org/W4247100793","https://openalex.org/W3159572760","https://openalex.org/W2782292024","https://openalex.org/W2551034790","https://openalex.org/W1502438505","https://openalex.org/W2951888513","https://openalex.org/W4301954754","https://openalex.org/W2019875157"],"abstract_inverted_index":{"Evolutionary":[0],"algorithms":[1,34,54,68],"have":[2],"been":[3],"frequently":[4],"used":[5],"to":[6,17,28,57,60,86],"deal":[7],"with":[8,55,94],"dynamic":[9,36,43,116],"optimization":[10,38],"problems,":[11],"but":[12],"their":[13,58],"success":[14],"is":[15,108],"hard":[16],"understand":[18],"from":[19],"a":[20,42,62,88,95],"theoretical":[21,30],"perspective.":[22],"With":[23],"this":[24],"paper,":[25],"we":[26,75,101],"contribute":[27],"the":[29,46,65,105,115],"understanding":[31],"of":[32,45,97],"evolutionary":[33,53,67],"for":[35,114],"combinatorial":[37],"problems.":[39],"We":[40],"examine":[41],"version":[44],"classical":[47],"vertex":[48,117],"cover":[49,118],"problem":[50],"and":[51],"analyse":[52],"respect":[56],"ability":[59],"maintain":[61,87],"2-approximation.":[63],"Analysing":[64],"different":[66],"studied":[69,81],"by":[70],"Jansen":[71],"et":[72],"al.":[73],"[7],":[74],"point":[76,102],"out":[77,103],"where":[78],"two":[79],"previously":[80],"approaches":[82],"are":[83],"not":[84],"able":[85],"2-approximation":[89],"even":[90],"if":[91],"they":[92],"start":[93],"solution":[96],"that":[98,104],"quality.":[99],"Furthermore,":[100],"third":[106],"approach":[107],"very":[109],"effective":[110],"in":[111],"maintaining":[112],"2-approximations":[113],"problem.":[119]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1}],"updated_date":"2026-02-09T09:26:11.010843","created_date":"2025-10-10T00:00:00"}