{"id":"https://openalex.org/W2604936630","doi":"https://doi.org/10.1145/3040718.3040726","title":"On the Use of the Dual Formulation for Minimum Weighted Vertex Cover in Evolutionary Algorithms","display_name":"On the Use of the Dual Formulation for Minimum Weighted Vertex Cover in Evolutionary Algorithms","publication_year":2017,"publication_date":"2017-01-12","ids":{"openalex":"https://openalex.org/W2604936630","doi":"https://doi.org/10.1145/3040718.3040726","mag":"2604936630"},"language":"en","primary_location":{"id":"doi:10.1145/3040718.3040726","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3040718.3040726","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 14th ACM/SIGEVO Conference on Foundations of Genetic Algorithms","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":["University of Adelaide, Adelaide, Australia"],"affiliations":[{"raw_affiliation_string":"University of Adelaide, Adelaide, Australia","institution_ids":["https://openalex.org/I5681781"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5077389210","display_name":"Tobias Friedrich","orcid":"https://orcid.org/0000-0003-0076-6308"},"institutions":[{"id":"https://openalex.org/I143288331","display_name":"Hasso Plattner Institute","ror":"https://ror.org/058rn5r42","country_code":"DE","type":"facility","lineage":["https://openalex.org/I143288331","https://openalex.org/I176453806"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Tobias Friedrich","raw_affiliation_strings":["Hasso Plattner Institute, Potsdam, Germany"],"affiliations":[{"raw_affiliation_string":"Hasso Plattner Institute, Potsdam, Germany","institution_ids":["https://openalex.org/I143288331"]}]},{"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":["University of Adelaide, Adelaide, Australia"],"affiliations":[{"raw_affiliation_string":"University of Adelaide, Adelaide, Australia","institution_ids":["https://openalex.org/I5681781"]}]}],"institutions":[],"countries_distinct_count":2,"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.1701,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.83648044,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"37","last_page":"44"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9983999729156494,"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.9983999729156494,"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.9966999888420105,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9955000281333923,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.7748573422431946},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6042647957801819},{"id":"https://openalex.org/keywords/edge-cover","display_name":"Edge cover","score":0.5772759318351746},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.560656726360321},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.5320751667022705},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5212550759315491},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.5030085444450378},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5011391639709473},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.48985573649406433},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.47599899768829346},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.44403499364852905},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4170073866844177},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.38037431240081787},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3746260404586792},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.18252408504486084}],"concepts":[{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.7748573422431946},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6042647957801819},{"id":"https://openalex.org/C17762858","wikidata":"https://www.wikidata.org/wiki/Q594001","display_name":"Edge cover","level":3,"score":0.5772759318351746},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.560656726360321},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.5320751667022705},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5212550759315491},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.5030085444450378},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5011391639709473},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.48985573649406433},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.47599899768829346},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.44403499364852905},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4170073866844177},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.38037431240081787},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3746260404586792},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.18252408504486084},{"id":"https://openalex.org/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","level":1,"score":0.0},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3040718.3040726","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3040718.3040726","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 14th ACM/SIGEVO Conference on Foundations of Genetic Algorithms","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":39,"referenced_works":["https://openalex.org/W603975761","https://openalex.org/W1576660662","https://openalex.org/W1593495653","https://openalex.org/W1605768620","https://openalex.org/W1632066424","https://openalex.org/W1793635223","https://openalex.org/W1985910644","https://openalex.org/W2002970881","https://openalex.org/W2004361255","https://openalex.org/W2005317641","https://openalex.org/W2011113110","https://openalex.org/W2028146345","https://openalex.org/W2053482941","https://openalex.org/W2061751517","https://openalex.org/W2064600658","https://openalex.org/W2081488245","https://openalex.org/W2084149434","https://openalex.org/W2088415500","https://openalex.org/W2100137329","https://openalex.org/W2120043459","https://openalex.org/W2138537392","https://openalex.org/W2151612665","https://openalex.org/W2156184725","https://openalex.org/W2157816158","https://openalex.org/W2159653361","https://openalex.org/W2339288500","https://openalex.org/W2395284556","https://openalex.org/W2499441210","https://openalex.org/W2518633304","https://openalex.org/W2611804663","https://openalex.org/W2751862591","https://openalex.org/W2950855788","https://openalex.org/W2962773240","https://openalex.org/W3122779104","https://openalex.org/W4230573295","https://openalex.org/W4301441647","https://openalex.org/W6618203353","https://openalex.org/W6844382842","https://openalex.org/W7029258064"],"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":{"We":[0],"consider":[1,55],"the":[2,38,52,56,77],"weighted":[3],"minimum":[4],"vertex":[5],"cover":[6],"problem":[7],"and":[8,37,65],"investigate":[9],"how":[10],"its":[11],"dual":[12],"formulation":[13],"can":[14],"be":[15],"exploited":[16],"to":[17,49],"design":[18],"evolutionary":[19],"algorithms":[20,64],"that":[21,31,67],"provably":[22],"obtain":[23],"a":[24,70,81],"2-approximation.":[25],"Investigating":[26],"multi-valued":[27],"representations,":[28],"we":[29,54],"show":[30,66],"variants":[32],"of":[33,58],"randomized":[34],"local":[35],"search":[36],"(1+1)EA":[39],"achieve":[40],"this":[41],"goal":[42],"in":[43,62,72],"expected":[44,73],"pseudo-polynomial":[45,82],"time.":[46],"In":[47],"order":[48],"speed":[50],"up":[51],"process,":[53],"use":[57],"step":[59],"size":[60],"adaptation":[61],"both":[63],"RLS":[68],"obtains":[69],"2-approximation":[71],"polynomial":[74],"time":[75],"while":[76],"one+one":[78],"still":[79],"encounters":[80],"lower":[83],"bound.":[84]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}