{"id":"https://openalex.org/W2969834682","doi":"https://doi.org/10.1145/3299904.3340314","title":"Runtime analysis of evolutionary algorithms for the depth restricted (1,2)-minimum spanning tree problem","display_name":"Runtime analysis of evolutionary algorithms for the depth restricted (1,2)-minimum spanning tree problem","publication_year":2019,"publication_date":"2019-08-19","ids":{"openalex":"https://openalex.org/W2969834682","doi":"https://doi.org/10.1145/3299904.3340314","mag":"2969834682"},"language":"en","primary_location":{"id":"doi:10.1145/3299904.3340314","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3299904.3340314","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms","raw_type":"proceedings-article"},"type":"conference-paper","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/A5068244151","display_name":"Feng Shi","orcid":"https://orcid.org/0000-0002-1415-0515"},"institutions":[{"id":"https://openalex.org/I139660479","display_name":"Central South University","ror":"https://ror.org/00f1zfq44","country_code":"CN","type":"education","lineage":["https://openalex.org/I139660479"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Feng Shi","raw_affiliation_strings":["Central South University, Changsha, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Central South University, Changsha, China","institution_ids":["https://openalex.org/I139660479"]}]},{"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":"The 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"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The University of Adelaide, Adelaide, Australia","institution_ids":["https://openalex.org/I5681781"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100438360","display_name":"Jianxin Wang","orcid":"https://orcid.org/0000-0003-1516-0480"},"institutions":[{"id":"https://openalex.org/I139660479","display_name":"Central South University","ror":"https://ror.org/00f1zfq44","country_code":"CN","type":"education","lineage":["https://openalex.org/I139660479"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jianxin Wang","raw_affiliation_strings":["Central South University, Changsha, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Central South University, Changsha, China","institution_ids":["https://openalex.org/I139660479"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"133","last_page":"146"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9965999722480774,"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"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9965999722480774,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9954000115394592,"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/T12176","display_name":"Optimization and Packing Problems","score":0.993399977684021,"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/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.7462096214294434},{"id":"https://openalex.org/keywords/set-cover-problem","display_name":"Set cover problem","score":0.6992313861846924},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.6714377403259277},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.5672573447227478},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.5490293502807617},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5349399447441101},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.5279495120048523},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.517885684967041},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.4973469078540802},{"id":"https://openalex.org/keywords/distributed-minimum-spanning-tree","display_name":"Distributed minimum spanning tree","score":0.49057215452194214},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.48395541310310364},{"id":"https://openalex.org/keywords/evolutionary-computation","display_name":"Evolutionary computation","score":0.4645305573940277},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.45298582315444946},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.431626558303833},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.42240041494369507},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4124511182308197},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2239016592502594}],"concepts":[{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.7462096214294434},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.6992313861846924},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.6714377403259277},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.5672573447227478},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.5490293502807617},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5349399447441101},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.5279495120048523},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.517885684967041},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.4973469078540802},{"id":"https://openalex.org/C65949645","wikidata":"https://www.wikidata.org/wiki/Q5283163","display_name":"Distributed minimum spanning tree","level":3,"score":0.49057215452194214},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.48395541310310364},{"id":"https://openalex.org/C105902424","wikidata":"https://www.wikidata.org/wiki/Q1197129","display_name":"Evolutionary computation","level":2,"score":0.4645305573940277},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.45298582315444946},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.431626558303833},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.42240041494369507},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4124511182308197},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2239016592502594},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","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},{"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/3299904.3340314","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3299904.3340314","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms","raw_type":"proceedings-article"},{"id":"pmh:oai:digital.library.adelaide.edu.au:2440/127230","is_oa":false,"landing_page_url":"http://hdl.handle.net/2440/127230","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/3299904.3340314","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":42,"referenced_works":["https://openalex.org/W116475295","https://openalex.org/W1631204983","https://openalex.org/W1638655381","https://openalex.org/W1683332710","https://openalex.org/W1965255372","https://openalex.org/W1965680834","https://openalex.org/W1979466622","https://openalex.org/W1992507224","https://openalex.org/W2033501672","https://openalex.org/W2061751517","https://openalex.org/W2066124178","https://openalex.org/W2070664846","https://openalex.org/W2086054344","https://openalex.org/W2088415500","https://openalex.org/W2094076493","https://openalex.org/W2141355868","https://openalex.org/W2148311277","https://openalex.org/W2151612665","https://openalex.org/W2153401898","https://openalex.org/W2156622046","https://openalex.org/W2157054705","https://openalex.org/W2159394395","https://openalex.org/W2166775052","https://openalex.org/W2168987613","https://openalex.org/W2336254308","https://openalex.org/W2489913264","https://openalex.org/W2558522968","https://openalex.org/W2585305412","https://openalex.org/W2602753196","https://openalex.org/W2604936630","https://openalex.org/W2752885492","https://openalex.org/W2802344229","https://openalex.org/W2885774179","https://openalex.org/W2888418128","https://openalex.org/W2888641532","https://openalex.org/W2911460560","https://openalex.org/W2913688336","https://openalex.org/W2914414140","https://openalex.org/W2962958080","https://openalex.org/W3122779104","https://openalex.org/W4372046852","https://openalex.org/W4396808240"],"related_works":["https://openalex.org/W4380840098","https://openalex.org/W2418231958","https://openalex.org/W2387385213","https://openalex.org/W2899787781","https://openalex.org/W2381121915","https://openalex.org/W2074214908","https://openalex.org/W4242086819","https://openalex.org/W4206043061","https://openalex.org/W2942013815","https://openalex.org/W2390742649"],"abstract_inverted_index":{"The":[0],"Minimum":[1],"Spanning":[2,38],"Tree":[3,39],"problem":[4,33,40],"is":[5,41],"a":[6,28,107,121],"well-known":[7],"combinatorial":[8],"optimization":[9],"problem,":[10,118,144],"which":[11,49],"has":[12],"attracted":[13],"much":[14],"attention":[15],"from":[16],"the":[17,20,26,32,44,59,63,70,73,83,111,115,126,132,141,154],"researchers":[18],"in":[19,43],"field":[21],"of":[22,31,46,66,69],"evolutionary":[23,47,123,138],"computing.":[24],"Within":[25],"paper,":[27],"constrained":[29,84,112,155],"version":[30,113,156],"named":[34],"Depth":[35],"Restricted":[36],"(1-2)-Minimum":[37],"considered":[42],"context":[45],"algorithms,":[48],"had":[50],"been":[51],"shown":[52],"to":[53,82,86,98],"be":[54,158],"NP-hard.":[55],"We":[56],"separately":[57],"investigate":[58],"expected":[60,64],"time":[61],"(i.e.,":[62],"number":[65],"fitness":[67,101],"evaluations)":[68],"(1+1)":[71],"EA,":[72],"Multi-Objective":[74],"Evolutionary":[75],"Algorithm":[76],"and":[77,114,119],"its":[78],"two":[79],"variants":[80],"adapted":[81],"version,":[85],"obtain":[87],"an":[88,145],"approximate":[89,133,146],"solution":[90,134,147],"with":[91,96,148],"ratio":[92,149],"2":[93],"or":[94],"3/2":[95,152],"respect":[97],"several":[99],"different":[100],"functions.":[102],"In":[103],"addition,":[104],"we":[105],"observe":[106],"close":[108],"connection":[109],"between":[110],"Set":[116],"Cover":[117,128,143],"present":[120],"simple":[122],"algorithm":[124,139],"for":[125,140,153],"3-Set":[127,142],"problem.":[129],"Based":[130],"on":[131],"returned":[135],"by":[136],"our":[137],"better":[150],"than":[151],"can":[157],"constructed.":[159]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":3}],"updated_date":"2026-07-15T18:14:33.161393","created_date":"2025-10-10T00:00:00"}