{"id":"https://openalex.org/W3094271017","doi":"https://doi.org/10.1145/3449639.3459363","title":"Evolutionary diversity optimization and the minimum spanning tree problem","display_name":"Evolutionary diversity optimization and the minimum spanning tree problem","publication_year":2021,"publication_date":"2021-06-21","ids":{"openalex":"https://openalex.org/W3094271017","doi":"https://doi.org/10.1145/3449639.3459363","mag":"3094271017"},"language":"en","primary_location":{"id":"doi:10.1145/3449639.3459363","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3449639.3459363","pdf_url":null,"source":{"id":"https://openalex.org/S4363608932","display_name":"Proceedings of the Genetic and Evolutionary Computation Conference","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Genetic and Evolutionary Computation Conference","raw_type":"proceedings-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2010.10913","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5083504710","display_name":"Jakob Bossek","orcid":"https://orcid.org/0000-0002-4121-4668"},"institutions":[{"id":"https://openalex.org/I22465464","display_name":"University of M\u00fcnster","ror":"https://ror.org/00pd74e08","country_code":"DE","type":"education","lineage":["https://openalex.org/I22465464"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Jakob Bossek","raw_affiliation_strings":["University of M\u00fcnster, M\u00fcnster, Germany"],"affiliations":[{"raw_affiliation_string":"University of M\u00fcnster, M\u00fcnster, Germany","institution_ids":["https://openalex.org/I22465464"]}]},{"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":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5083504710"],"corresponding_institution_ids":["https://openalex.org/I22465464"],"apc_list":null,"apc_paid":null,"fwci":2.7925,"has_fulltext":false,"cited_by_count":23,"citation_normalized_percentile":{"value":0.92311247,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"198","last_page":"206"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9993000030517578,"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.9993000030517578,"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/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9940999746322632,"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.9873999953269958,"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/spanning-tree","display_name":"Spanning tree","score":0.6895439028739929},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5899057984352112},{"id":"https://openalex.org/keywords/evolutionary-computation","display_name":"Evolutionary computation","score":0.5461635589599609},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.5295162200927734},{"id":"https://openalex.org/keywords/pairwise-comparison","display_name":"Pairwise comparison","score":0.5287812948226929},{"id":"https://openalex.org/keywords/population","display_name":"Population","score":0.5258563160896301},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5243892073631287},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.509486734867096},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4809648096561432},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.47824612259864807},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.4570891559123993},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.38841933012008667},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.278322696685791},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.19660663604736328},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.11918908357620239},{"id":"https://openalex.org/keywords/biology","display_name":"Biology","score":0.09250107407569885}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.6895439028739929},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5899057984352112},{"id":"https://openalex.org/C105902424","wikidata":"https://www.wikidata.org/wiki/Q1197129","display_name":"Evolutionary computation","level":2,"score":0.5461635589599609},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.5295162200927734},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.5287812948226929},{"id":"https://openalex.org/C2908647359","wikidata":"https://www.wikidata.org/wiki/Q2625603","display_name":"Population","level":2,"score":0.5258563160896301},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5243892073631287},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.509486734867096},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4809648096561432},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.47824612259864807},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.4570891559123993},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.38841933012008667},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.278322696685791},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.19660663604736328},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.11918908357620239},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.09250107407569885},{"id":"https://openalex.org/C144024400","wikidata":"https://www.wikidata.org/wiki/Q21201","display_name":"Sociology","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/C149923435","wikidata":"https://www.wikidata.org/wiki/Q37732","display_name":"Demography","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3449639.3459363","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3449639.3459363","pdf_url":null,"source":{"id":"https://openalex.org/S4363608932","display_name":"Proceedings of the Genetic and Evolutionary Computation Conference","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Genetic and Evolutionary Computation Conference","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:2010.10913","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2010.10913","pdf_url":"https://arxiv.org/pdf/2010.10913","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:digital.library.adelaide.edu.au:2440/134974","is_oa":false,"landing_page_url":"https://hdl.handle.net/2440/134974","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/3449639.3459363","raw_type":"Conference paper"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2010.10913","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2010.10913","pdf_url":"https://arxiv.org/pdf/2010.10913","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":36,"referenced_works":["https://openalex.org/W4690622","https://openalex.org/W73629738","https://openalex.org/W1632066424","https://openalex.org/W1843453084","https://openalex.org/W1965680834","https://openalex.org/W1970879550","https://openalex.org/W2017927472","https://openalex.org/W2045243279","https://openalex.org/W2059690430","https://openalex.org/W2060441747","https://openalex.org/W2097449954","https://openalex.org/W2099746672","https://openalex.org/W2110786553","https://openalex.org/W2154596660","https://openalex.org/W2160642345","https://openalex.org/W2187602868","https://openalex.org/W2474885930","https://openalex.org/W2479047430","https://openalex.org/W2582743722","https://openalex.org/W2589615383","https://openalex.org/W2726056738","https://openalex.org/W2740307401","https://openalex.org/W2898873842","https://openalex.org/W2913059114","https://openalex.org/W2948946638","https://openalex.org/W2952579308","https://openalex.org/W2962686327","https://openalex.org/W2962809967","https://openalex.org/W2962961217","https://openalex.org/W2963640987","https://openalex.org/W3016842374","https://openalex.org/W3091447387","https://openalex.org/W3127900374","https://openalex.org/W4240139199","https://openalex.org/W4255306344","https://openalex.org/W4372046852"],"related_works":["https://openalex.org/W2099915933","https://openalex.org/W2418231958","https://openalex.org/W4380840098","https://openalex.org/W3116169590","https://openalex.org/W1703428550","https://openalex.org/W2044443696","https://openalex.org/W3101281637","https://openalex.org/W2390742649","https://openalex.org/W1561849181","https://openalex.org/W3081212354"],"abstract_inverted_index":{"In":[0,47],"the":[1,6,26,34,52,60,71,82,86,131],"area":[2],"of":[3,8,11,37,62,73,85,98,128,161,164],"evolutionary":[4,28,39],"computation":[5],"calculation":[7],"diverse":[9,112],"sets":[10,113],"high-quality":[12],"solutions":[13,138],"to":[14,140],"a":[15,96,126,142,150,158],"given":[16],"optimization":[17,43,64,89],"problem":[18,57,90],"has":[19],"gained":[20],"momentum":[21],"in":[22,59,117],"recent":[23],"years":[24],"under":[25],"term":[27],"diversity":[29,42,63,67,88],"optimization.":[30],"Theoretical":[31,77],"insights":[32,80],"into":[33,81],"working":[35],"principles":[36],"baseline":[38],"algorithms":[40],"for":[41,95,130],"are":[44],"still":[45],"rare.":[46],"this":[48],"paper":[49],"we":[50],"study":[51],"well-known":[53],"Minimum":[54],"Spanning":[55],"Tree":[56],"(MST)":[58],"context":[61],"where":[65,136],"population":[66,97,160],"is":[68],"measured":[69],"by":[70],"sum":[72],"pairwise":[74],"edge":[75],"overlaps.":[76],"results":[78,124,147],"provide":[79],"fitness":[83,102],"landscape":[84],"MST":[87],"pointing":[91],"out":[92],"that":[93,149],"even":[94],"\u03bc":[99],"=":[100],"2":[101],"plateaus":[103],"(of":[104],"constant":[105],"length)":[106],"can":[107,114,155],"be":[108,115],"reached,":[109],"but":[110],"nevertheless":[111],"calculated":[116],"polynomial":[118],"time.":[119],"We":[120],"supplement":[121],"our":[122],"theoretical":[123],"with":[125],"series":[127],"experiments":[129],"unconstrained":[132],"and":[133],"constraint":[134],"case":[135],"all":[137],"need":[139],"fulfill":[141],"minimal":[143],"quality":[144],"threshold.":[145],"Our":[146],"show":[148],"simple":[151],"(\u03bc":[152],"+":[153],"1)-EA":[154],"effectively":[156],"compute":[157],"diversified":[159],"spanning":[162],"trees":[163],"high":[165],"quality.":[166]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":8},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":9},{"year":2021,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}