{"id":"https://openalex.org/W2785385648","doi":"https://doi.org/10.1109/ssci.2017.8285391","title":"Improved runtime analysis of RLS and (1+1) EA for the dynamic vertex cover problem","display_name":"Improved runtime analysis of RLS and (1+1) EA for the dynamic vertex cover problem","publication_year":2017,"publication_date":"2017-11-01","ids":{"openalex":"https://openalex.org/W2785385648","doi":"https://doi.org/10.1109/ssci.2017.8285391","mag":"2785385648"},"language":"en","primary_location":{"id":"doi:10.1109/ssci.2017.8285391","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ssci.2017.8285391","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE Symposium Series on Computational Intelligence (SSCI)","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":["Optimisation and Logistics School of Computer Science, The University of Adelaide, Adelaide, Australia"],"affiliations":[{"raw_affiliation_string":"Optimisation and Logistics School of Computer Science, The University of Adelaide, Adelaide, Australia","institution_ids":["https://openalex.org/I5681781"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5019685276","display_name":"Vahid Roostapour","orcid":"https://orcid.org/0000-0002-8896-9590"},"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":"Vahid Roostapour","raw_affiliation_strings":["Optimisation and Logistics School of Computer Science, The University of Adelaide, Adelaide, Australia"],"affiliations":[{"raw_affiliation_string":"Optimisation and Logistics School of Computer Science, 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":["Optimisation and Logistics School of Computer Science, The University of Adelaide, Adelaide, Australia"],"affiliations":[{"raw_affiliation_string":"Optimisation and Logistics School of Computer Science, 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":1.3627,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.83725699,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9983999729156494,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9983999729156494,"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"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.998199999332428,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9961000084877014,"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.8342083692550659},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.6720015406608582},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6531232595443726},{"id":"https://openalex.org/keywords/edge-cover","display_name":"Edge cover","score":0.5215913653373718},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5147337913513184},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5094199776649475},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.46489137411117554},{"id":"https://openalex.org/keywords/dynamic-problem","display_name":"Dynamic problem","score":0.4635753929615021},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.41608723998069763},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.39480555057525635},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3830069303512573},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3727814555168152},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3580487370491028},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.061698973178863525}],"concepts":[{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.8342083692550659},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.6720015406608582},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6531232595443726},{"id":"https://openalex.org/C17762858","wikidata":"https://www.wikidata.org/wiki/Q594001","display_name":"Edge cover","level":3,"score":0.5215913653373718},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5147337913513184},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5094199776649475},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.46489137411117554},{"id":"https://openalex.org/C99580578","wikidata":"https://www.wikidata.org/wiki/Q5319002","display_name":"Dynamic problem","level":2,"score":0.4635753929615021},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.41608723998069763},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39480555057525635},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3830069303512573},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3727814555168152},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3580487370491028},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.061698973178863525},{"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.1109/ssci.2017.8285391","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ssci.2017.8285391","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE Symposium Series on Computational Intelligence (SSCI)","raw_type":"proceedings-article"},{"id":"pmh:oai:digital.library.adelaide.edu.au:2440/112245","is_oa":false,"landing_page_url":"http://hdl.handle.net/2440/112245","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://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=8267146","raw_type":"Conference paper"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320334704","display_name":"Australian Research Council","ror":"https://ror.org/05mmh0f86"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1956082775","https://openalex.org/W1985910644","https://openalex.org/W2011113110","https://openalex.org/W2079241742","https://openalex.org/W2088415500","https://openalex.org/W2120043459","https://openalex.org/W2129679961","https://openalex.org/W2151612665","https://openalex.org/W2604936630","https://openalex.org/W2731672985","https://openalex.org/W2962958080","https://openalex.org/W2963428892","https://openalex.org/W6683584534"],"related_works":["https://openalex.org/W2551034790","https://openalex.org/W2029933769","https://openalex.org/W2056597184","https://openalex.org/W1712180277","https://openalex.org/W1502438505","https://openalex.org/W1968988491","https://openalex.org/W2125212169","https://openalex.org/W2538178083","https://openalex.org/W1548167816","https://openalex.org/W4285240128"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,51,75,143],"perform":[4],"theoretical":[5],"analyses":[6],"of":[7,10,45,84,118,120],"the":[8,20,46,72,81,85,116,121,151],"behaviour":[9],"an":[11,132],"evolutionary":[12],"algorithm":[13,18],"and":[14,124],"a":[15,53,59,64,77,89,128,157],"randomised":[16],"search":[17],"on":[19],"dynamic":[21,26,82,90,153],"vertex":[22,27],"cover":[23,28],"problem.":[24],"The":[25],"problem":[29],"has":[30],"already":[31],"been":[32],"theoretically":[33],"investigated":[34],"for":[35,58,80],"these":[36],"two":[37],"algorithms":[38],"to":[39,62],"some":[40,44],"extent.":[41],"We":[42,103],"improve":[43],"existing":[47],"results,":[48],"i.":[49],"e.":[50],"find":[52,127],"linear":[54],"expected":[55,137,147],"re-optimization":[56],"time":[57,138,148],"(1+1)":[60,125],"EA":[61,126],"maintain":[63],"2-approximation":[65],"when":[66,106],"edges":[67,119],"are":[68],"dynamically":[69],"deleted":[70],"from":[71,131],"graph.":[73],"Furthermore,":[74,142],"investigate":[76],"different":[78],"setting":[79],"version":[83],"problem,":[86],"in":[87,136,146],"which":[88],"change":[91],"happens":[92],"at":[93],"each":[94],"step":[95],"with":[96],"probability":[97],"P":[98,107],"<sub":[99,108],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[100,109],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">D</sub>":[101,110],".":[102],"prove":[104,144],"that":[105,145],"\u2264":[111],"1/(2+\u03f5)em,":[112],"where":[113],"m":[114],"is":[115],"number":[117],"graph,":[122],"RLS":[123],"2-approximate":[129,158],"solution":[130,135],"arbitrary":[133],"initial":[134],"O(m":[139],"log":[140],"m).":[141],"O(m)":[149],"after":[150],"first":[152],"change,":[154],"they":[155],"recompute":[156],"solution.":[159]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}